Lower-order penalization approach to nonlinear semidefinite programming
From MaRDI portal
Publication:995945
DOI10.1007/S10957-006-9055-2zbMATH Open1156.90010OpenAlexW2001122878MaRDI QIDQ995945FDOQ995945
Authors: Xuexiang Huang, Xiao Qi Yang, Kok Lay Teo 
Publication date: 10 September 2007
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-006-9055-2
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
optimality conditionsEkeland variational principleSemidefinite programminglower-order penalty methods
Cites Work
- Semidefinite Programming
- Handbook of semidefinite programming. Theory, algorithms, and applications
- Second Order Optimality Conditions Based on Parabolic Second Order Tangent Sets
- Mathematical Programs with Equilibrium Constraints
- Calmness and Exact Penalization
- An Exact Penalization Viewpoint of Constrained Optimization
- Title not available (Why is that?)
- Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
- First and second order analysis of nonlinear semidefinite programs
- Lagrange-type functions in constrained non-convex optimization.
- Optimality conditions for nonconvex semidefinite programming
- Sensitivity analysis of optimization problems under second order regular constraints
- First Order Conditions for General Nonlinear Optimization
- A Unified Augmented Lagrangian Approach to Duality and Exact Penalization
- An interior method for nonconvex semidefinite programs
- A Squared Smoothing Newton Method for Nonsmooth Matrix Equations and Its Applications in Semidefinite Optimization Problems
- Semidefinite Programs: New Search Directions, Smoothing-Type Methods, and Numerical Results
- Second Derivatives for Optimizing Eigenvalues of Symmetric Matrices
- A nonlinear Lagrangian approach to constrained optimization problems
- Decreasing Functions with Applications to Penalization
- Robust Control via Sequential Semidefinite Programming
- Approximating quadratic programming with bound and quadratic constraints
- Optimal design of trusses under a nonconvex global buckling constraint
- Nonlinear Lagrange duality theorems and penalty function methods in continuous optimization
- An augmented Lagrangian method for a class of LMI-constrained problems in robust control theory
- On Eigenvalue Optimization
- Quadratic maximization and semidefinite relaxation
- Lower-order penalty methods for mathematical programs with complementarity constraints
- A sequential quadratic penalty method for nonlinear semidefinite programming
- Title not available (Why is that?)
- Title not available (Why is that?)
- Solving a class of semidefinite programs via nonlinear programming
- Further Results on Approximating Nonconvex Quadratic Optimization by Semidefinite Programming Relaxation
- Penalty/Barrier multiplier algorthm for semidefinit programming∗
- Interior-point algorithms for semidefinite programming based on a nonlinear formulation
- Partially strictly monotone and nonlinear penalty functions for constrained mathematical programs
- Title not available (Why is that?)
Cited In (14)
- A novel approach for solving semidefinite programs
- On the convergence of augmented Lagrangian methods for nonlinear semidefinite programming
- Convergence of a class of penalty methods for constrained scalar set-valued optimization
- Global convergence of modified augmented Lagrangian methods for nonlinear semidefinite programming
- The differentiable exact penalty function for nonlinear semidefinite programming
- Superlinear convergence of an SQP-type method for nonlinear semidefinite programming
- PENNON: A code for convex nonlinear and semidefinite programming
- An interior point method with a primal-dual quadratic barrier penalty function for nonlinear semidefinite programming
- Necessary and sufficient global optimality conditions for NLP reformulations of linear SDP problems
- An equivalent nonlinear optimization model with triangular low-rank factorization for semidefinite programs
- A Penalty-Free Method with Trust Region for Nonlinear Semidefinite Programming
- A primal-dual interior point trust-region method for nonlinear semidefinite programming
- Guidance trajectories for spacecraft rendezvous
- Calmness and exact penalization in constrained scalar set-valued optimization
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)
