A new QP-free algorithm without a penalty function or a filter for nonlinear semidefinite programming
From MaRDI portal
(Redirected from Publication:2023745)
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
- scientific article; zbMATH DE number 3583207 (Why is no real title available?)
- scientific article; zbMATH DE number 1502618 (Why is no real title available?)
- A Global Algorithm for Nonlinear Semidefinite Programming
- A QP-Free, Globally Convergent, Locally Superlinearly Convergent Algorithm for Inequality Constrained Optimization
- A filter algorithm for nonlinear semidefinite programming
- A filter method for nonlinear semidefinite programming with global convergence
- A globally convergent QP-free algorithm for nonlinear semidefinite programming
- A primal-dual interior point method for nonlinear semidefinite programming
- An interior method for nonconvex semidefinite programs
- An interior point method with a primal-dual quadratic barrier penalty function for nonlinear semidefinite programming
- Differentiable merit function for shifted perturbed Karush-Kuhn-Tucker conditions of nonlinear semidefinite programming
- First and second order analysis of nonlinear semidefinite programs
- Global convergence of modified augmented Lagrangian methods for nonlinear semidefinite programming
- Handbook of semidefinite programming. Theory, algorithms, and applications
- Local convergence of an augmented Lagrangian method for matrix inequality constrained programming
- Matrix Analysis
- Nonlinear semidefinite programming: sensitivity, convergence, and an application in passive reduced-order modeling
- On the Nesterov--Todd Direction in Semidefinite Programming
- On the convergence of augmented Lagrangian methods for nonlinear semidefinite programming
- On the superlinear local convergence of a penalty-free method for nonlinear semidefinite programming
- Optimal design of trusses under a nonconvex global buckling constraint
- PENNON: A code for convex nonlinear and semidefinite programming
- Properties of the augmented Lagrangian in nonlinear semidefinite optimization
- Robust Control via Sequential Semidefinite Programming
- Successive linearization methods for nonlinear semidefinite programs
- Test examples for nonlinear programming codes
- The rate of convergence of the augmented Lagrangian method for 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
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)
