Lower-order penalization approach to nonlinear semidefinite programming
From MaRDI portal
Publication:995945
Recommendations
- A sequential quadratic penalty method for nonlinear semidefinite programming
- A line search exact penalty method for nonlinear semidefinite programming
- A sequential quadratic penalty method for nonlinear semidefinite programming
- The differentiable exact penalty function for nonlinear semidefinite programming
- A successive linearization method with flexible penalty for nonlinear semidefinite programming
Cites work
- scientific article; zbMATH DE number 1101503 (Why is no real title available?)
- scientific article; zbMATH DE number 1131479 (Why is no real title available?)
- scientific article; zbMATH DE number 1534299 (Why is no real title available?)
- scientific article; zbMATH DE number 1534305 (Why is no real title available?)
- A Squared Smoothing Newton Method for Nonsmooth Matrix Equations and Its Applications in Semidefinite Optimization Problems
- A Unified Augmented Lagrangian Approach to Duality and Exact Penalization
- A nonlinear Lagrangian approach to constrained optimization problems
- A sequential quadratic penalty method for nonlinear semidefinite programming
- An Exact Penalization Viewpoint of Constrained Optimization
- An augmented Lagrangian method for a class of LMI-constrained problems in robust control theory
- An interior method for nonconvex semidefinite programs
- Approximating quadratic programming with bound and quadratic constraints
- Calmness and Exact Penalization
- Decreasing Functions with Applications to Penalization
- First Order Conditions for General Nonlinear Optimization
- First and second order analysis of nonlinear semidefinite programs
- Further Results on Approximating Nonconvex Quadratic Optimization by Semidefinite Programming Relaxation
- Handbook of semidefinite programming. Theory, algorithms, and applications
- Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
- Interior-point algorithms for semidefinite programming based on a nonlinear formulation
- Lagrange-type functions in constrained non-convex optimization.
- Lower-order penalty methods for mathematical programs with complementarity constraints
- Mathematical Programs with Equilibrium Constraints
- Nonlinear Lagrange duality theorems and penalty function methods in continuous optimization
- On Eigenvalue Optimization
- Optimal design of trusses under a nonconvex global buckling constraint
- Optimality conditions for nonconvex semidefinite programming
- Partially strictly monotone and nonlinear penalty functions for constrained mathematical programs
- Penalty/Barrier multiplier algorthm for semidefinit programming∗
- Quadratic maximization and semidefinite relaxation
- Robust Control via Sequential Semidefinite Programming
- Second Derivatives for Optimizing Eigenvalues of Symmetric Matrices
- Second Order Optimality Conditions Based on Parabolic Second Order Tangent Sets
- Semidefinite Programming
- Semidefinite Programs: New Search Directions, Smoothing-Type Methods, and Numerical Results
- Sensitivity analysis of optimization problems under second order regular constraints
- Solving a class of semidefinite programs via nonlinear programming
Cited in
(14)- A Penalty-Free Method with Trust Region for Nonlinear Semidefinite Programming
- The differentiable exact penalty function for nonlinear semidefinite programming
- Calmness and exact penalization in constrained scalar set-valued optimization
- Global convergence of modified augmented Lagrangian methods for nonlinear semidefinite programming
- Superlinear convergence of an SQP-type method for nonlinear semidefinite programming
- A novel approach for solving semidefinite programs
- An equivalent nonlinear optimization model with triangular low-rank factorization for semidefinite programs
- On the convergence of augmented Lagrangian methods for nonlinear semidefinite programming
- A primal-dual interior point trust-region method for nonlinear semidefinite programming
- Guidance trajectories for spacecraft rendezvous
- PENNON: A code for convex nonlinear and semidefinite programming
- Convergence of a class of penalty methods for constrained scalar set-valued optimization
- Necessary and sufficient global optimality conditions for NLP reformulations of linear SDP problems
- An interior point method with a primal-dual quadratic barrier penalty function for nonlinear semidefinite programming
This page was built for publication: Lower-order penalization approach to nonlinear semidefinite programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q995945)
