Primal-dual path following method for nonlinear semi-infinite programs with semi-definite constraints

DOI10.1007/s10107-022-01827-2zbMath1517.90099arXiv1810.00353OpenAlexW2892788252MaRDI QIDQ6038645

Takayuki Okuno, Masao Fukushima

Publication date: 2 May 2023

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

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

zbMATH Keywords

global convergencesuperlinear convergencepath-following methodsemi-infinite programnonlinear semidefinite program

Mathematics Subject Classification ID

Semidefinite programming (90C22) Nonconvex programming, global optimization (90C26) Semi-infinite programming (90C34)

Related Items (1)

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Solving semi-infinite programs by smoothing projected gradient method
• Relaxed cutting plane method with convexification for solving nonlinear semi-infinite programming problems
• A primal-dual interior point method for nonlinear semidefinite programming
• Local reduction based SQP-type method for semi-infinite programs with an infinite number of second-order cone constraints
• Nonlinear semidefinite programming: sensitivity, convergence, and an application in passive reduced-order modeling
• A globally convergent SQP method for semi-infinite nonlinear optimization
• Discretization methods for the solution of semi-infinite programming problems
• First and second order analysis of nonlinear semidefinite programs
• Semi-infinite programming. Workshop, Cottbus, Germany, September 1996
• Semismooth Newton methods for solving semi-infinite programming problems
• Cutting plane algorithms for nonlinear semi-definite programming problems with applications
• Second-order cone programming
• A smoothing Newton method for semi-infinite programming
• An interior point sequential quadratic programming-type method for log-determinant semi-infinite programs
• Local and superlinear convergence of a primal-dual interior point method for nonlinear semidefinite programming
• Robust envelope-constrained filter with orthonormal bases and semi-definite and semi-infinite programming
• A relaxed cutting plane method for semi-infinite semi-definite programming
• A successive SDP-NSDP approach to a robust optimization problem in finance
• Interior point filter method for semi-infinite programming problems
• Semi-Infinite Programming: Theory, Methods, and Applications
• A reduction method for semi-infinite programming by means of a global stochastic approach†
• Feasible Method for Semi-Infinite Programs
• The Adaptive Convexification Algorithm: A Feasible Point Method for Semi-Infinite Programming
• An Explicit Exchange Algorithm For Linear Semi-Infinite Programming Problems With Second-Order Cone Constraints
• On the Nesterov--Todd Direction in Semidefinite Programming
• SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
• Sparse Filter Design Under a Quadratic Constraint: Low-Complexity Algorithms
• A Global Algorithm for Nonlinear Semidefinite Programming
• A solution method for combined semi-infinite and semi-definite programming
• Local Convergence of SQP Methods in Semi-Infinite Programming
• A Regularized Explicit Exchange Method for Semi-Infinite Programs with an Infinite Number of Conic Constraints
• A SURVEY OF NUMERICAL METHODS FOR NONLINEAR SEMIDEFINITE PROGRAMMING
• Semi-infinite programming. Recent advances
• Discretization in semi-infinite programming: the rate of convergence

This page was built for publication: Primal-dual path following method for nonlinear semi-infinite programs with semi-definite constraints