Elementary Optimality Conditions for Nonlinear SDPs

DOI10.1007/978-1-4614-0769-0_16zbMath1334.90106OpenAlexW83615645MaRDI QIDQ2802534

Florian Jarre

Publication date: 26 April 2016

Published in: International Series in Operations Research & Management Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-1-4614-0769-0_16

zbMATH Keywords

constraint qualificationfirst order optimality conditionssecond order optimality conditionsnonlinear semidefinite programs

Mathematics Subject Classification ID

Semidefinite programming (90C22) Nonlinear programming (90C30) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)

Related Items

Inverse truss design as a conic mathematical program with equilibrium constraints ⋮ Exact augmented Lagrangian functions for nonlinear semidefinite programming ⋮ Sufficient optimality conditions hold for almost all nonlinear semidefinite programs ⋮ Optimality conditions for nonlinear semidefinite programming via squared slack variables ⋮ First- and second-order optimality conditions for second-order cone and semidefinite programming under a constant rank condition ⋮ On the weak second-order optimality condition for nonlinear semidefinite and second-order cone programming ⋮ Optimality conditions and global convergence for nonlinear semidefinite programming ⋮ Optimality Conditions in Semidefinite Programming

Uses Software

• AMPL

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Nonlinear semidefinite programming: sensitivity, convergence, and an application in passive reduced-order modeling
• Applications of the notion of analytic center in approximation (estimation) problems
• First and second order analysis of nonlinear semidefinite programs
• Free Material Optimization for Plates and Shells
• Generalized equations and their solutions, part II: Applications to nonlinear programming
• First Order Conditions for General Nonlinear Optimization
• Semidefinite relaxation and nonconvex quadratic optimization
• Robust Control via Sequential Semidefinite Programming
• Loss of Superlinear Convergence for an SQP-Type Method with Conic Constraints