On methods for solving nonlinear semidefinite optimization problems

DOI10.3934/NACO.2011.1.1zbMATH Open1220.90085OpenAlexW2018661363MaRDI QIDQ550502FDOQ550502

Authors: Jie Sun 

Publication date: 11 July 2011

Published in: Numerical Algebra, Control and Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/naco.2011.1.1

Recommendations

• A Global Algorithm for Nonlinear Semidefinite Programming
• Introduction of some algorithms for nonlinear semidefinite programming
• Nonsingularity Conditions for the Fischer–Burmeister System of Nonlinear SDPs
• Local and superlinear convergence of a primal-dual interior point method for nonlinear semidefinite programming
• A nonlinear Lagrangian for constructing algorithms for nonlinear semidefinite programming

zbMATH Keywords

alternating direction methodaugmented Lagrangian methodsemismooth Newton method

Mathematics Subject Classification ID

Convex programming (90C25) Semidefinite programming (90C22)

Cited In (8)

• Semismooth Reformulation and Nonsmooth Newton’s Method for Solving Nonlinear Semidefinite Programming
• Nonlinear structure methods in optimization problems: A survey of the work of N. N. Redkovskij
• Augmented Lagrangian functions for cone constrained optimization: the existence of global saddle points and exact penalty property
• Title not available (Why is that?)
• Nonsingularity of FB system and constraint nondegeneracy in semidefinite programming
• A Penalty-Free Method with Trust Region for Nonlinear Semidefinite Programming
• Some notes on the nonlinear simplex method
• How mature is nonlinear optimization?

This page was built for publication: On methods for solving nonlinear semidefinite optimization problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q550502)