Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 29 for “"composite optimization"”.

  1. Variational Analysis Of Composite Optimization

    … and second-order variational analysis of the composite functions with applications to composite optimization. By considering a fairly general composite optimization problem, our analysis covers numerous classes of optimization problems such as constrained optimization; in particular, nonlinear …

    wayne-thes Repository record for Variational Analysis Of Composite Optimization (opens in a new tab)

  2. Proximal Methods for Nonconvex Composite Optimization Problems

    Optimization problems with composite functions deal with the minimization of the sum of a smooth function and a convex nonsmooth function. In this thesis several numerical methods for solving such problems in finite-dimensional spaces are discussed, which are based on proximity operators. After …

    wurz-thes Repository record for Proximal Methods for Nonconvex Composite Optimization Problems (opens in a new tab)

  3. Local and Global Convergence for Convex-Composite Optimization

    Convex-composite optimization seeks to minimize f(x):=h(c(x)) over x in R^n, where h is closed, proper, and convex, and c is smooth. Such problems include nonlinear programming, mini-max optimization, estimation of nonlinear dynamics with non-Gaussian noise as well as many modern approaches to …

    washington Repository record for Local and Global Convergence for Convex-Composite Optimization (opens in a new tab)

  4. Design and Analysis of Algorithms for Composite Optimization

    … methods (FOMs) for solving three types of composite optimization problems: convex nonsmooth, convex hybrid, and nonconcex smooth. We revisit three representative methods among FOMs: proximal point, proximal bundle, and accelerated composite gradient (ACG). We use them to design fast …

    gatech Repository record for Design and Analysis of Algorithms for Composite Optimization (opens in a new tab)

  5. Accelerated Inexact First-Order Methods for Solving Nonconvex Composite Optimization Problems

    … finding stationary points of various nonconvex composite optimization (NCO) problems. Our main tools mainly come from variational and convex analysis, and our key results are in the form of iteration complexity bounds and how these bounds compare to other ones in the literature. Our first study …

    gatech Repository record for Accelerated Inexact First-Order Methods for Solving Nonconvex Composite Optimization Problems (opens in a new tab)

  6. Variational Analysis And Stability In Optimization

    … parameterized problems of constrained optimization, which has been well recognized as a very important property from both viewpoints of optimization theory and its applications. Employing second-order subdifferentials of variational analysis, we obtain necessary and sufficient …

    wayne-thes Repository record for Variational Analysis And Stability In Optimization (opens in a new tab)

  7. Second-Order Generalized Differentiation Of Piecewise Linear-Quadratic Functions And Its Applications

    … recent years with many important applications in optimization. This dissertation is devoted to the study and applications of the second-order generalized differentiation of a remarkable class of convex extended-real-valued functions that is highly important in many aspects of nonlinear and …

    wayne-thes Repository record for Second-Order Generalized Differentiation Of Piecewise Linear-Quadratic Functions And Its Applications (opens in a new tab)

  8. Fast First-Order Methods for Large-Scale Nonconvex Optimization and Semidefinite Programming

    … for solving unconstrained convex/strongly convex composite optimization problems, linearly-constrained nonconvex composite optimization problems, and semidefinite programs. We show through extensive computational experiments that the algorithms developed in this thesis are anywhere from 5 to 100 …

    gatech Repository record for Fast First-Order Methods for Large-Scale Nonconvex Optimization and Semidefinite Programming (opens in a new tab)

  9. Augmented Lagrangian Methods invoking (Proximal) Gradient-type Methods for (Composite) Structured Optimization Problems

    … augmented Lagrangian method for the solution of optimization problems with geometric constraints, subsequently, as well as constrained structured optimization problems featuring a composite objective function and set-membership constraints. It is then concerned to convergence and …

    wurz-thes Repository record for Augmented Lagrangian Methods invoking (Proximal) Gradient-type Methods for (Composite) Structured Optimization Problems (opens in a new tab)

  10. A Composite Algorithm for Mixed Integer Constrained Nonlinear Optimization

    A composite optimization algorithm applicable to mixed integer, constrained, nonlinear problems is developed in this research. One major component of the composite algorithm is a modified version of the nonlinear simplex method. Significant modifications are made to this algorithm including the …

    uiuc Repository record for A Composite Algorithm for Mixed Integer Constrained Nonlinear Optimization (opens in a new tab)

  11. First-Order Algorithms for Nonlinear Structured Optimization

    Nonlinear optimization is a critical branch in applied mathematics and has attracted wide attention due to its popularity in practical applications. In this work, we present two methods which use first-order information to solve two typical classes of nonlinear structured optimization problems. For …

    lsu-thes Repository record for First-Order Algorithms for Nonlinear Structured Optimization (opens in a new tab)

  12. Saddle point techniques in convex composite and error-in-measurement optimization

    … and stability properties for large-scale optimization and optimization under uncertainty, and to bridge some of the gaps between modern optimization theories and recent applications emerging in the Big Data environment. To this end, the dissertation is dedicated to two important subjects …

    gatech Repository record for Saddle point techniques in convex composite and error-in-measurement optimization (opens in a new tab)

  13. Αλγόριθμοι και τεχνικές συγχρονισμού ασύρματων ψηφιακών δεκτών ορθογώνιας γραμμικής διαμόρφωσης

    … thesis is composed of three main parts. First, a composite optimization methodology based on the steepest-descent and the quasi-Newton minimax algorithms is developed for the prompt design of physically realizable biquadratic pulse shaping filters for data transmission. Current work has proved …

    greece Repository record for Αλγόριθμοι και τεχνικές συγχρονισμού ασύρματων ψηφιακών δεκτών ορθογώνιας γραμμικής διαμόρφωσης (opens in a new tab)

  14. Accelerated first-order optimization methods using inertia and error bounds

    Optimization is an important discipline of applied mathematics with far-reaching applications. Optimization algorithms often form the backbone of practical systems in machine learning, image processing, signal processing, computer vision, data analysis, and statistics. In an age of massive data …

    uiuc Repository record for Accelerated first-order optimization methods using inertia and error bounds (opens in a new tab)

  15. Development of a model for optimizing water storage

    … purpose of this study is to develop an efficient optimization model to determine storage strategies for water supply purpose in multi-reservoir systems. The specific goals in designing a multi-reservoir system for water supply purpose is to optimize the reservoir sizes and configurations to …

    concordia Download PDF for Development of a model for optimizing water storage (opens in a new tab)

  16. Methods for large-scale constrained optimization

    … methodologies for large-scale constrained optimization problems. The dissertation is organized into four main chapters (Chapters 2, 3, 4 and 5). Each chapter is self-contained and focuses on a particular structure of nonlinear constrained optimization problem, introducing and analyzing new …

    texas Repository record for Methods for large-scale constrained optimization (opens in a new tab)

  17. Projection-Free and Accelerated Methods for Constrained Optimization and Saddle-Points Problems

    This dissertation investigates primal-dual optimization methods for solving nonconvex problems in both stochastic and deterministic settings. The proposed methods address challenges in feasibility, scalability, and computational efficiency, offering robust solutions with theoretical guarantees. In …

    arizona-thes Repository record for Projection-Free and Accelerated Methods for Constrained Optimization and Saddle-Points Problems (opens in a new tab)

  18. New insights into conjugate duality

    … - Lagrange dual problems to a given primal optimization problem can be obtained via perturbations and we present some connections between them. For the Fenchel - Lagrange dual problem we prove strong duality under more general conditions than known so far, while for the Fenchel duality we …

    qucosa-diss

  19. Convex and structured nonconvex optimization for modern machine learning: Complexity and algorithms

    In this thesis, we investigate various optimization problems motivated by applications in modern-day machine learning. In the first part, we look at the computational complexity of training ReLU neural networks. We consider the following problem: given a fully-connected two hidden layer ReLU neural …

    gatech Repository record for Convex and structured nonconvex optimization for modern machine learning: Complexity and algorithms (opens in a new tab)

Page 1 of 2