On the convergence of augmented Lagrangian methods for nonlinear semidefinite programming
type: Item
instance of: scholarly article
title: On the convergence of augmented Lagrangian methods for nonlinear semidefinite programming
zbMATH Open document ID: 1261.90035
author: Yanyan Li
published in: Journal of Global Optimization
publication date: 2013-01-03T00:00:00Z
Mathematics Subject Classification ID: 90C22
zbMATH DE Number: 6121378
zbMATH Keywords: nonlinear semidefinite program
zbMATH Keywords: modified augmented Lagrangian methods
zbMATH Keywords: convergence to an \(\epsilon\)-global solution
zbMATH Keywords: boundedness of multipliers
MaRDI profile type: Publication
full work available at URL: s10898-011-9779-x
OpenAlex ID: W2004616048
cites work: On Augmented Lagrangian Methods with General Lower-Level Constraints
cites work: Augmented Lagrangian methods under the constant positive linear dependence constraint qualification
cites work: Optimal design of trusses under a nonconvex global buckling constraint
cites work: Numerical comparison of augmented Lagrangian algorithms for nonconvex problems
cites work: Global minimization using an augmented Lagrangian method with variable lower-level constraints
cites work: Q4503250
cites work: Linear Matrix Inequalities in System and Control Theory
cites work: Constraint Nondegeneracy, Strong Regularity, and Nonsingularity in Semidefinite Programming
cites work: A Globally Convergent Augmented Lagrangian Algorithm for Optimization with General Constraints and Simple Bounds
cites work: A Global Algorithm for Nonlinear Semidefinite Programming
cites work: An augmented Lagrangian method for a class of LMI-constrained problems in robust control theory
cites work: Robust Control via Sequential Semidefinite Programming
cites work: Optimality conditions for nonconvex semidefinite programming
cites work: Advances in Linear Matrix Inequality Methods in Control
cites work: Approximate augmented Lagrangian functions and nonlinear semidefinite programs
cites work: Lower-order penalization approach to nonlinear semidefinite programming
cites work: Q5480813
cites work: An interior method for nonconvex semidefinite programs
cites work: Semidefinite Programs: New Search Directions, Smoothing-Type Methods, and Numerical Results
cites work: On representations of the feasible set in convex optimization
cites work: Separation approach for augmented lagrangians in Constrained nonconvex optimization
cites work: On the Convergence of Augmented Lagrangian Methods for Constrained Global Optimization
cites work: Convergence properties of augmented Lagrangian methods for constrained global optimization
cites work: Convergence properties of modified and partially-augmented Lagrangian methods for mathematical programs with complementarity constraints
cites work: On the convergence properties of modified augmented Lagrangian methods for mathematical programming with complementarity constraints
cites work: Penalty/Barrier multiplier algorthm for semidefinit programming∗
cites work: Local convergence of an augmented Lagrangian method for matrix inequality constrained programming
cites work: Partially Augmented Lagrangian Method for Matrix Inequality Constraints
cites work: Semidefinite relaxations of dynamical programs under discrete constraints
cites work: Novel approaches to hard discrete optimization
cites work: Topics in semidefinite and interior-point methods
cites work: An augmented Lagrangian function with improved exactness properties
cites work: Local Duality of Nonlinear Semidefinite Programming
cites work: Lagrange Multipliers and Optimality
cites work: First and second order analysis of nonlinear semidefinite programs
cites work: Some Properties of the Augmented Lagrangian in Cone Constrained Optimization
cites work: The Strong Second-Order Sufficient Condition and Constraint Nondegeneracy in Nonlinear Semidefinite Programming and Their Implications
cites work: The rate of convergence of the augmented Lagrangian method for nonlinear semidefinite programming
cites work: Properties of the augmented Lagrangian in nonlinear semidefinite optimization
cites work: Semidefinite optimization
cites work: Semidefinite Programming
cites work: How to generate weakly infeasible semidefinite programs via Lasserre's relaxations for polynomial optimization
cites work: Unified theory of augmented Lagrangian methods for constrained global optimization
cites work: Handbook of semidefinite programming. Theory, algorithms, and applications
cites work: The global convergence of augmented Lagrangian methods based on NCP function in constrained nonconvex optimization
cites work: Saddle points of general augmented Lagrangians for constrained nonconvex optimization
cites work: Q4382667
DOI: 10.1007/S10898-011-9779-X
description: scientific article; zbMATH DE number 6121378