A filter method for nonlinear semidefinite programming with global convergence
From MaRDI portal
Publication:477865
DOI10.1007/S10114-014-3241-1zbMATH Open1327.90187OpenAlexW2016506754MaRDI QIDQ477865FDOQ477865
Authors: Zhibin Zhu, Huali Zhu 
Publication date: 10 December 2014
Published in: Acta Mathematica Sinica, English Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10114-014-3241-1
Recommendations
- A filter algorithm for nonlinear semidefinite programming
- A globally convergent SSDP algorithm without a penalty function or a filter for nonlinear semidefinite programming
- A filter-type method for solving nonlinear semidefinite programming
- On filter-successive linearization methods for nonlinear semidefinite programming
- A nonmonotone filter method for nonlinear optimization
Cites Work
- Semidefinite Programming
- Semidefinite optimization
- On the Global Convergence of a Filter--SQP Algorithm
- Handbook of semidefinite programming. Theory, algorithms, and applications
- Nonlinear programming without a penalty function.
- A trust region filter method for general non-linear programming
- Generalized Farkas lemma and optimality conditions for nonconvex semidefinite programming
- An SQP-filter method for inequality constrained optimization and its global convergence
- Sequential penalty quadratic programming filter methods for nonlinear programming
- The Strong Second-Order Sufficient Condition and Constraint Nondegeneracy in Nonlinear Semidefinite Programming and Their Implications
- Nonlinear semidefinite programming: sensitivity, convergence, and an application in passive reduced-order modeling
- An Interior Point Constrained Trust Region Method for a Special Class of Nonlinear Semidefinite Programming Problems
- Local and superlinear convergence of a primal-dual interior point method for nonlinear semidefinite programming
- A Global Algorithm for Nonlinear Semidefinite Programming
- A filter algorithm for nonlinear semidefinite programming
- Successive linearization methods for nonlinear semidefinite programs
- The rate of convergence of the augmented Lagrangian method for nonlinear semidefinite programming
- Title not available (Why is that?)
- Title not available (Why is that?)
- Trust region methods for solving the optimal output feedback design problem
Cited In (15)
- Global convergence of slanting filter methods for nonlinear programming
- A line search SQP-type method with bi-object strategy for nonlinear semidefinite programming
- Global and local convergence of a filter line search method for nonlinear programming
- Local convergence of filter methods for equality constrained non-linear programming
- A Globally Convergent Filter Method for Nonlinear Programming
- A new QP-free algorithm without a penalty function or a filter for nonlinear semidefinite programming
- On filter-successive linearization methods for nonlinear semidefinite programming
- Optimality conditions and global convergence for nonlinear semidefinite programming
- A globally convergent QP-free algorithm for nonlinear semidefinite programming
- Convergence to a second-order critical point by a primal-dual interior point trust-region method for nonlinear semidefinite programming
- A stabilized sequential quadratic semidefinite programming method for degenerate nonlinear semidefinite programs
- A superlinearly convergent SSDP algorithm for nonlinear semidefinite programming
- A primal-dual interior point trust-region method for nonlinear semidefinite programming
- A filter algorithm for nonlinear semidefinite programming
- A filter-type method for solving nonlinear semidefinite programming
Uses Software
This page was built for publication: A filter method for nonlinear semidefinite programming with global convergence
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q477865)
