Nonlinear semidefinite programming: sensitivity, convergence, and an application in passive reduced-order modeling
From MaRDI portal
Publication:868464
Abstract: We consider the solution of nonlinear programs with nonlinear semidefiniteness constraints. The need for an efficient exploitation of the cone of positive semidefinite matrices makes the solution of such nonlinear semidefinite programs more complicated than the solution of standard nonlinear programs. In particular, a suitable symmetrization procedure needs to be chosen for the linearization of the complementarity condition. The choice of the symmetrization procedure can be shifted in a very natural way to certain linear semidefinite subproblems, and can thus be reduced to a well-studied problem. The resulting sequential semidefinite programming (SSP) method is a generalization of the well-known SQP method for standard nonlinear programs. We present a sensitivity result for nonlinear semidefinite programs, and then based on this result, we give a self-contained proof of local quadratic convergence of the SSP method. We also describe a class of nonlinear semidefinite programs that arise in passive reduced-order modeling, and we report results of some numerical experiments with the SSP method applied to problems in that class.
Recommendations
- A sequential quadratic penalty method for nonlinear semidefinite programming
- Successive linearization methods for nonlinear semidefinite programs
- An Interior Point Constrained Trust Region Method for a Special Class of Nonlinear Semidefinite Programming Problems
- A superlinearly convergent SSDP algorithm for nonlinear semidefinite programming
- A survey of numerical methods for nonlinear semidefinite programming
Cites work
- scientific article; zbMATH DE number 3583207 (Why is no real title available?)
- scientific article; zbMATH DE number 1495709 (Why is no real title available?)
- scientific article; zbMATH DE number 1534290 (Why is no real title available?)
- scientific article; zbMATH DE number 780774 (Why is no real title available?)
- A Global Algorithm for Nonlinear Semidefinite Programming
- A sensitivity result for semidefinite programs.
- An Interior-Point Method for Semidefinite Programming
- An augmented Lagrangian method for a class of LMI-constrained problems in robust control theory
- An extension of the positive real lemma to descriptor systems
- Conditioning of semidefinite programs
- Eigenvalue-based characterization and test for positive realness of scalar transfer functions
- First Order Conditions for General Nonlinear Optimization
- First and second order analysis of nonlinear semidefinite programs
- Generalized equations and their solutions, part II: Applications to nonlinear programming
- Handbook of semidefinite programming. Theory, algorithms, and applications
- Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
- Interior-Point Methods for the Monotone Semidefinite Linear Complementarity Problem in Symmetric Matrices
- Interior-point methods for nonconvex nonlinear programming: Filter methods and merit functions
- Large-Scale Optimization of Eigenvalues
- Linear Matrix Inequalities in System and Control Theory
- Model reduction methods based on Krylov subspaces
- On Minimizing the Maximum Eigenvalue of a Symmetric Matrix
- On sensitivity of central solutions in semidefinite programming
- PENNON: A code for convex nonlinear and semidefinite programming
- Primal--Dual Path-Following Algorithms for Semidefinite Programming
- Primal-Dual Interior-Point Methods for Self-Scaled Cones
- Primal-Dual Interior-Point Methods for Semidefinite Programming: Convergence Rates, Stability and Numerical Results
- Robust Control via Sequential Semidefinite Programming
- Self-Scaled Barriers and Interior-Point Methods for Convex Programming
- Semidefinite Programming
- Semidefinite optimization
- Superlinear Convergence of a Symmetric Primal-Dual Path Following Algorithm for Semidefinite Programming
Cited in
(40)- A note on computing the smallest conic singular value
- A Penalty-Free Method with Trust Region for Nonlinear Semidefinite Programming
- A line search SQP-type method with bi-object strategy for nonlinear semidefinite programming
- Convergence of a weighted barrier algorithm for stochastic convex quadratic semidefinite optimization
- A homotopy method based on penalty function for nonlinear semidefinite programming
- On the use of Jordan algebras for improving global convergence of an augmented Lagrangian method in nonlinear semidefinite programming
- Energy-regenerative model predictive control
- Local and superlinear convergence of a primal-dual interior point method for nonlinear semidefinite programming
- Superlinear convergence of an SQP-type method for nonlinear semidefinite programming
- A sensitivity result for quadratic second-order cone programming and its application.
- An approximation technique for robust nonlinear optimization
- Environmental game modeling with uncertainties
- An implicitly-restarted Krylov subspace method for real symmetric/skew-symmetric eigenproblems
- Primal-dual path following method for nonlinear semi-infinite programs with semi-definite constraints
- Sequential parametric convex approximation algorithm for bilinear matrix inequality problem
- A sensitivity result for quadratic semidefinite programs with an application to a sequential quadratic semidefinite programming algorithm
- A globally convergent QP-free algorithm for nonlinear semidefinite programming
- An equivalency condition of nonsingularity in nonlinear semidefinite programming
- A homotopy method for nonlinear semidefinite programming
- An SQP-type method with superlinear convergence for nonlinear semidefinite programming
- A new QP-free algorithm without a penalty function or a filter for nonlinear semidefinite programming
- Local convergence of primal-dual interior point methods for nonlinear semidefinite optimization using the Monteiro-Tsuchiya family of search directions
- The nonconvex second-order cone: algebraic structure toward optimization
- 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
- Sufficient optimality conditions hold for almost all nonlinear semidefinite programs
- Multihazard design: Structural optimization approach
- Optimality conditions and global convergence for nonlinear semidefinite programming
- Convergence to a second-order critical point by a primal-dual interior point trust-region method for nonlinear semidefinite programming
- Stability preservation in projection-based model order reduction of large scale systems
- Elementary optimality conditions for nonlinear SDPs
- A stabilized sequential quadratic semidefinite programming method for degenerate nonlinear semidefinite programs
- A self-concordance property for nonconvex semidefinite programming
- On the superlinear local convergence of a penalty-free method for nonlinear semidefinite programming
- A filter method for nonlinear semidefinite programming with global convergence
- An interior point method with a primal-dual quadratic barrier penalty function for nonlinear semidefinite programming
- Complexity analysis of interior-point methods for second-order stationary points of nonlinear semidefinite optimization problems
- A primal-dual interior point method for nonlinear semidefinite programming
- Bilinear matrix inequality‐based nonquadratic controller design for polytopic‐linear parameter varying systems
- Stochastic modeling of stationary scalar Gaussian processes in continuous time from autocorrelation data
This page was built for publication: Nonlinear semidefinite programming: sensitivity, convergence, and an application in passive reduced-order modeling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q868464)
