A new QP-free algorithm without a penalty function or a filter for nonlinear semidefinite programming
From MaRDI portal
Publication:2023745
DOI10.1007/S10255-020-0964-XzbMATH Open1466.90068OpenAlexW3081621465MaRDI QIDQ2023745FDOQ2023745
Authors: Jian-Ling Li, Jia-qi Wu, Zhen-Ping Yang, Jinbao Jian 
Publication date: 3 May 2021
Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10255-020-0964-x
Recommendations
- A globally convergent QP-free algorithm for nonlinear semidefinite programming
- A globally convergent SSDP algorithm without a penalty function or a filter for nonlinear semidefinite programming
- A trust region type algorithm without a penalty and a filter for nonlinear semidefinite programming
- A QP-free algorithm without a penalty function or a filter for nonlinear general-constrained optimization
- A Penalty-Free Method with Trust Region for Nonlinear Semidefinite Programming
Cites Work
- PENNON: A code for convex nonlinear and semidefinite programming
- Matrix Analysis
- Title not available (Why is that?)
- Handbook of semidefinite programming. Theory, algorithms, and applications
- Test examples for nonlinear programming codes
- A QP-Free, Globally Convergent, Locally Superlinearly Convergent Algorithm for Inequality Constrained Optimization
- Title not available (Why is that?)
- First and second order analysis of nonlinear semidefinite programs
- On the Nesterov--Todd Direction in Semidefinite Programming
- Nonlinear semidefinite programming: sensitivity, convergence, and an application in passive reduced-order modeling
- An interior method for nonconvex semidefinite programs
- Robust Control via Sequential Semidefinite Programming
- A Global Algorithm for Nonlinear Semidefinite Programming
- Local convergence of an augmented Lagrangian method for matrix inequality constrained programming
- A filter algorithm for nonlinear semidefinite programming
- A primal-dual interior point method for nonlinear semidefinite programming
- Successive linearization methods for nonlinear semidefinite programs
- The rate of convergence of the augmented Lagrangian method for nonlinear semidefinite programming
- Optimal design of trusses under a nonconvex global buckling constraint
- An interior point method with a primal-dual quadratic barrier penalty function for nonlinear 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
- On the convergence of augmented Lagrangian methods for nonlinear semidefinite programming
- Global convergence of modified augmented Lagrangian methods for nonlinear semidefinite programming
- Properties of the augmented Lagrangian in nonlinear semidefinite optimization
- A globally convergent QP-free algorithm for nonlinear semidefinite programming
- Differentiable merit function for shifted perturbed Karush-Kuhn-Tucker conditions of nonlinear semidefinite programming
Cited In (4)
- A globally convergent SSDP algorithm without a penalty function or a filter for nonlinear semidefinite programming
- A smooth QP-free algorithm without a penalty function or a filter for mathematical programs with complementarity constraints
- A globally convergent QP-free algorithm for nonlinear semidefinite programming
- A trust region type algorithm without a penalty and a filter for nonlinear semidefinite programming
Uses Software
This page was built for publication: A new QP-free algorithm without a penalty function or a filter for nonlinear semidefinite programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2023745)
