Complexity analysis of interior-point methods for second-order stationary points of nonlinear semidefinite optimization problems

DOI10.1007/s10589-023-00501-3zbMath1522.90073arXiv2103.14320MaRDI QIDQ6051305

Shun Arahata, Akiko Takeda, Takayuki Okuno

Publication date: 19 October 2023

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2103.14320

zbMATH Keywords

nonlinear semidefinite programmingprimal-dual interior-point methodnegative curvature directionsecond-order stationary points

Mathematics Subject Classification ID

Semidefinite programming (90C22) Nonconvex programming, global optimization (90C26) Interior-point methods (90C51)

Cites Work

• Unnamed Item
• Unnamed Item
• An interior point method with a primal-dual quadratic barrier penalty function for nonlinear semidefinite programming
• A trust region algorithm with a worst-case iteration complexity of \(\mathcal{O}(\epsilon ^{-3/2})\) for nonconvex optimization
• A primal-dual interior point method for nonlinear semidefinite programming
• On the superlinear local convergence of a penalty-free 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
• A second-order method for the general nonlinear programming problem
• Convergence to a second-order point of a trust-region algorithm with a nonmonotonic penalty parameter for constrained optimization
• First and second order analysis of nonlinear semidefinite programs
• An augmented Lagrangian interior-point method using directions of negative curvature
• Cutting plane algorithms for nonlinear semi-definite programming problems with applications
• Optimality conditions for nonconvex semidefinite programming
• A primal-dual trust-region algorithm for non-convex nonlinear programming
• Exact augmented Lagrangian functions for nonlinear semidefinite programming
• Concise complexity analyses for trust region methods
• Using negative curvature in solving nonlinear programs
• Algorithms for positive semidefinite factorization
• An interior method for nonconvex semidefinite programs
• An interior point sequential quadratic programming-type method for log-determinant semi-infinite programs
• Complexity of proximal augmented Lagrangian for nonconvex optimization with nonlinear equality constraints
• Finding second-order stationary points in constrained minimization: a feasible direction approach
• Optimality conditions and global convergence for nonlinear semidefinite programming
• A Newton-CG algorithm with complexity guarantees for smooth unconstrained optimization
• Second-order negative-curvature methods for box-constrained and general constrained optimization
• Estimation of failure probability using semi-definite logit model
• Optimality conditions for nonlinear semidefinite programming via squared slack variables
• Exploiting negative curvature in deterministic and stochastic optimization
• Local and superlinear convergence of a primal-dual interior point method for nonlinear semidefinite programming
• Cubic regularization of Newton method and its global performance
• A nonlinear SDP approach to fixed-order controller synthesis and comparison with two other methods applied to an active suspension system
• A successive SDP-NSDP approach to a robust optimization problem in finance
• Convergence to Second Order Stationary Points in Inequality Constrained Optimization
• Newton Methods For Large-Scale Linear Inequality-Constrained Minimization
• An augmented Lagrangian method for a class of LMI-constrained problems in robust control theory
• Local Duality of Nonlinear Semidefinite Programming
• A Quadratically Convergent Newton Method for Computing the Nearest Correlation Matrix
• Some NP-complete problems in quadratic and nonlinear programming
• Newton’s Method with a Model Trust Region Modification
• Penalty methods for computing points that satisfy second order necessary conditions
• A modification of Armijo's step-size rule for negative curvature
• First-Order Methods in Optimization
• A Global Algorithm for Nonlinear Semidefinite Programming
• Solving nonconvex SDP problems of structural optimization with stability control
• An Interior Point Constrained Trust Region Method for a Special Class of Nonlinear Semidefinite Programming Problems
• An Analytical Model to Predict Optimal Material Properties in the Context of Optimal Structural Design
• A log-barrier Newton-CG method for bound constrained optimization with complexity guarantees
• Correction
• Convergence to a second-order critical point by a primal-dual interior point trust-region method for nonlinear semidefinite programming
• A Trust Region Method for Finding Second-Order Stationarity in Linearly Constrained Nonconvex Optimization
• A TWO-STEP PRIMAL-DUAL INTERIOR POINT METHOD FOR NONLINEAR SEMIDEFINITE PROGRAMMING PROBLEMS AND ITS SUPERLINEAR CONVERGENCE
• Learning the parts of objects by non-negative matrix factorization
• Convergence to Second-Order Stationary Points of a Primal-Dual Algorithm Model for Nonlinear Programming
• The Strong Second-Order Sufficient Condition and Constraint Nondegeneracy in Nonlinear Semidefinite Programming and Their Implications
• On second-order optimality conditions for nonlinear programming
• Trust-Region Newton-CG with Strong Second-Order Complexity Guarantees for Nonconvex Optimization
• Handbook of semidefinite programming. Theory, algorithms, and applications
• 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

This page was built for publication: Complexity analysis of interior-point methods for second-order stationary points of nonlinear semidefinite optimization problems