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 11 of 11 for “"augmented Lagrangian methods"”.

  1. LOW-RANK AUGMENTED LAGRANGIAN METHODS FOR SDP RELAXATIONS

    This thesis develops scalable methods for large semidefinite programming relaxations arising from nonconvex optimization. For doubly nonnegative relaxations of mixed-binary quadratic programs, it introduces RiNNAL, a globally convergent augmented Lagrangian method that exploits low-rank structure …

    nus Repository record for LOW-RANK AUGMENTED LAGRANGIAN METHODS FOR SDP RELAXATIONS (opens in a new tab) Download file for LOW-RANK AUGMENTED LAGRANGIAN METHODS FOR SDP RELAXATIONS (opens in a new tab)

  2. Augmented Lagrangian Methods for State Constrained Optimal Control Problems

    … to the state constraint. Applying an augmented Lagrangian method we overcome these difficulties by working with multiplier approximations in $L^2(\Omega)$. For each problem class, we introduce the solution algorithm, carry out a thoroughly convergence analysis and illustrate our …

    wurz-thes Repository record for Augmented Lagrangian Methods for State Constrained Optimal Control Problems (opens in a new tab)

  3. AUGMENTED LAGRANGIAN METHODS FOR A CLASS OF LARGE-SCALE CONIC PROGRAMMING

    … The first part of this thesis focuses on the augmented Lagrangian method for solving convex quadratic programming problems with linear and conic constraints. In the second part of the thesis, we consider solving a special class of CQP, namely second-order cone programming, which has many …

    nus Repository record for AUGMENTED LAGRANGIAN METHODS FOR A CLASS OF LARGE-SCALE CONIC PROGRAMMING (opens in a new tab) Download file for AUGMENTED LAGRANGIAN METHODS FOR A CLASS OF LARGE-SCALE CONIC PROGRAMMING (opens in a new tab)

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

    … theoretical and numerical investigation of an 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 …

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

  5. Novel first-order methods for bilevel and minimax optimization.

    … optimization and develops novel first-order methods with strong theoretical guarantees for solving both classes of problems. Specifically, we study a class of constrained minimax problems and propose efficient augmented Lagrangian methods with complexity guarantees for both nonconvex-concave …

    umn Repository record for Novel first-order methods for bilevel and minimax optimization. (opens in a new tab)

  6. Nonconvex Optimization Methods Under Inexact Information

    … We introduce Inexact Reduced Gradient (IRG) methods for general smooth functions and Inexact Gradient Descent (IGD) methods for $\mathcal{C}^{1,1}_L$ functions with relative and absolute errors. Additionally, we develop Inexact Proximal Point and Inexact Proximal Gradient methods for weakly …

    wayne-thes Repository record for Nonconvex Optimization Methods Under Inexact Information (opens in a new tab)

  7. An augmented Lagrangian algorithm for optimization with equality constraints in Hilbert spaces

    Since augmented Lagrangian methods were introduced by Powell and Hestenes, this class of methods has been investigated very intensively. While the finite dimensional case has been treated in a satisfactory manner, the infinite dimensional case is studied much less. The general approach to solve an …

    vt Repository record for An augmented Lagrangian algorithm for optimization with equality constraints in Hilbert spaces (opens in a new tab)

  8. Privacy-Preserving Decentralized Optimization and Event Localization

    … a completely decentralized solution based on augmented Lagrangian methods and ADMM is proposed to solve the non-smooth and non-convex problem directly, rather than using conventional convex relaxation techniques. However, this algorithm requires the target event to be within the convex hull of …

    clemson Repository record for Privacy-Preserving Decentralized Optimization and Event Localization (opens in a new tab)

  9. Distributed Optimization Algorithms for Networked Systems

    <p>Distributed optimization methods allow us to decompose an optimization problem</p><p>into smaller, more manageable subproblems that are solved in parallel. For this</p><p>reason, they are widely used to solve large-scale problems arising in areas as diverse</p><p>as wireless communications, …

    duke Repository record for Distributed Optimization Algorithms for Networked Systems (opens in a new tab)

  10. AUGMENTED LAGRANGIAN BASED ALGORITHMS FOR CONVEX OPTIMIZATION PROBLEMS WITH NON-SEPARABLE L1-REGULARIZATION

    … We propose an inexact semi-smooth Newton augmented Lagrangian (SSNAL) algorithm to solve an equivalent reformulation of the problem, and establish comprehensive results on the global convergence and local rate of convergence of the algorithm. For the purpose of exposition and comparison, …

    nus Repository record for AUGMENTED LAGRANGIAN BASED ALGORITHMS FOR CONVEX OPTIMIZATION PROBLEMS WITH NON-SEPARABLE L1-REGULARIZATION (opens in a new tab) Download file for AUGMENTED LAGRANGIAN BASED ALGORITHMS FOR CONVEX OPTIMIZATION PROBLEMS WITH NON-SEPARABLE L1-REGULARIZATION (opens in a new tab)