A primal-dual interior point method for nonlinear semidefinite programming
From MaRDI portal
Publication:715092
DOI10.1007/s10107-011-0449-zzbMath1273.90150OpenAlexW2153271882MaRDI QIDQ715092
Hiroshi Yamashita, Kouhei Harada, Hiroshi Yabe
Publication date: 15 October 2012
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-011-0449-z
global convergencenonlinear semidefinite programmingprimal-dual merit functionprimal-dual interior point methodbarrier penalty function
Semidefinite programming (90C22) Nonconvex programming, global optimization (90C26) Interior-point methods (90C51)
Related Items
A stochastic approximation method for convex programming with many semidefinite constraints ⋮ A globally convergent QP-free algorithm for nonlinear semidefinite programming ⋮ Exact augmented Lagrangian functions for nonlinear semidefinite programming ⋮ A line search SQP-type method with bi-object strategy for nonlinear semidefinite programming ⋮ Convergence to a second-order critical point by a primal-dual interior point trust-region method for nonlinear semidefinite programming ⋮ Global convergence of modified augmented Lagrangian methods for nonlinear semidefinite programming ⋮ An SQP-type Method with Superlinear Convergence for Nonlinear Semidefinite Programming ⋮ A homotopy method for nonlinear semidefinite programming ⋮ Primal-dual path following method for nonlinear semi-infinite programs with semi-definite constraints ⋮ A stabilized sequential quadratic semidefinite programming method for degenerate nonlinear semidefinite programs ⋮ Complexity analysis of interior-point methods for second-order stationary points of nonlinear semidefinite optimization problems ⋮ Distributionally robust expected residual minimization for stochastic variational inequality problems ⋮ A revised sequential quadratic semidefinite programming method for nonlinear semidefinite optimization ⋮ Local and superlinear convergence of a primal-dual interior point method for nonlinear semidefinite programming ⋮ Sequential constant rank constraint qualifications for nonlinear semidefinite programming with algorithmic applications ⋮ An interior point method with a primal-dual quadratic barrier penalty function for nonlinear semidefinite programming ⋮ S<i>l</i><sub>1</sub>QP Based Algorithm with Trust Region Technique for Solving Nonlinear Second-Order Cone Programming Problems ⋮ A homotopy method based on penalty function for nonlinear semidefinite programming ⋮ An interior point sequential quadratic programming-type method for log-determinant semi-infinite programs ⋮ A new QP-free algorithm without a penalty function or a filter for nonlinear semidefinite programming ⋮ A strategy of global convergence for the affine scaling algorithm for convex semidefinite programming ⋮ On the superlinear local convergence of a penalty-free method for nonlinear semidefinite programming ⋮ On the use of Jordan algebras for improving global convergence of an augmented Lagrangian method in nonlinear semidefinite programming ⋮ Optimality conditions and global convergence for nonlinear semidefinite programming ⋮ Nonlinear separation approach for the augmented Lagrangian in nonlinear semidefinite programming ⋮ A line search exact penalty method for nonlinear semidefinite programming ⋮ A projected gradient method for optimization over density matrices ⋮ A superlinearly convergent SSDP algorithm for nonlinear semidefinite programming ⋮ Self-concordant inclusions: a unified framework for path-following generalized Newton-type algorithms ⋮ An alternating direction method for solving convex nonlinear semidefinite programming problems ⋮ A primal-dual interior point trust-region method for nonlinear semidefinite programming ⋮ On filter-successive linearization methods for nonlinear semidefinite programming ⋮ Unnamed Item ⋮ A novel approach for solving semidefinite programs ⋮ On saddle points in semidefinite optimization via separation scheme ⋮ A primal-dual interior point method for large-scale free material optimization
Uses Software
Cites Work
- Unnamed Item
- Successive linearization methods for nonlinear semidefinite programs
- Nonlinear semidefinite programming: sensitivity, convergence, and an application in passive reduced-order modeling
- A globally and superlinearly convergent primal-dual interior point trust region method for large scale constrained optimization
- An interior method for nonconvex semidefinite programs
- Estimation of failure probability using semi-definite logit model
- Local and superlinear convergence of a primal-dual interior point method for nonlinear semidefinite programming
- Interior-Point Methods for the Monotone Semidefinite Linear Complementarity Problem in Symmetric Matrices
- An augmented Lagrangian method for a class of LMI-constrained problems in robust control theory
- Semidefinite optimization
- A Quadratically Convergent Newton Method for Computing the Nearest Correlation Matrix
- Primal-Dual Interior-Point Methods for Semidefinite Programming: Convergence Rates, Stability and Numerical Results
- On the Nesterov--Todd Direction in Semidefinite Programming
- Self-Scaled Barriers and Interior-Point Methods for Convex Programming
- Primal--Dual Path-Following Algorithms for Semidefinite Programming
- Determinant Maximization with Linear Matrix Inequality Constraints
- Primal-Dual Interior-Point Methods for Self-Scaled Cones
- PENNON: A code for convex nonlinear and semidefinite programming
- SDPLIB 1.2, a library of semidefinite programming test problems
- Robust Control via Sequential Semidefinite Programming
- A Global Algorithm for Nonlinear Semidefinite Programming
- Convergent Infeasible Interior-Point Trust-Region Methods for Constrained Minimization
- Semidefinite Programming
- An Interior-Point Method for Semidefinite Programming
- A globally convergent primal-dual interior point method for constrained optimization
- Handbook of semidefinite programming. Theory, algorithms, and applications
