On the use of Jordan algebras for improving global convergence of an augmented Lagrangian method in nonlinear semidefinite programming
From MaRDI portal
Publication:2044492
DOI10.1007/s10589-021-00281-8zbMath1482.90137OpenAlexW3163615686MaRDI QIDQ2044492
Ellen H. Fukuda, Gabriel Haeser, L. D. Secchin, D. O. Santos, Roberto Andreani
Publication date: 9 August 2021
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-021-00281-8
optimality conditionssymmetric conesaugmented Lagrangian methodnonlinear semidefinite programmingprimal-dual interior point method
Related Items
Convergence to a second-order critical point by a primal-dual interior point trust-region method for nonlinear semidefinite programming ⋮ On the weak second-order optimality condition for nonlinear semidefinite and second-order cone programming ⋮ On the fulfillment of the complementary approximate Karush-Kuhn-Tucker conditions and algorithmic applications ⋮ A revised sequential quadratic semidefinite programming method for nonlinear semidefinite optimization ⋮ Optimality conditions for nonlinear second-order cone programming and symmetric cone programming ⋮ Sequential constant rank constraint qualifications for nonlinear semidefinite programming with algorithmic applications
Cites Work
- Unnamed Item
- Unnamed Item
- On approximate KKT condition and its extension to continuous variational inequalities
- A primal-dual interior point method for nonlinear semidefinite programming
- Nonlinear semidefinite programming: sensitivity, convergence, and an application in passive reduced-order modeling
- Sequential semidefinite program for maximum robustness design of structures under load uncertainty
- Convexity and differentiability properties of spectral functions and spectral mappings on Euclidean Jordan algebras
- A second-order optimality condition with first- and second-order complementarity associated with global convergence of algorithms
- Inexact-restoration algorithm for constrained optimization
- An augmented Lagrangian method for quasi-equilibrium problems
- Optimality conditions and global convergence for nonlinear semidefinite programming
- Optimality condition and complexity analysis for linearly-constrained optimization without differentiability on the boundary
- Estimation of failure probability using semi-definite logit model
- A New Sequential Optimality Condition for Constrained Optimization and Algorithmic Consequences
- An augmented Lagrangian method for a class of LMI-constrained problems in robust control theory
- On Augmented Lagrangian Methods with General Lower-Level Constraints
- Determinant Maximization with Linear Matrix Inequality Constraints
- On the Constant Positive Linear Dependence Condition and Its Application to SQP Methods
- Robust Control via Sequential Semidefinite Programming
- An Augmented Lagrangian Method for Optimization Problems in Banach Spaces
- Optimality Conditions and Constraint Qualifications for Generalized Nash Equilibrium Problems and Their Practical Implications
- Erratum “A second-order sequential optimality condition associated to the convergence of optimization algorithms”
- Two New Weak Constraint Qualifications and Applications
- A Sequential Convex Semidefinite Programming Algorithm with an Application to Multiple-Load Free Material Optimization
- New Sequential Optimality Conditions for Mathematical Programs with Complementarity Constraints and Algorithmic Consequences
- Strict Constraint Qualifications and Sequential Optimality Conditions for Constrained Optimization
- Optimality Conditions for Problems over Symmetric Cones and a Simple Augmented Lagrangian Method
- Generalized Kuhn–Tucker Conditions for Mathematical Programming Problems in a Banach Space
- On sequential optimality conditions for smooth constrained optimization
