On the superlinear local convergence of a penalty-free method for nonlinear semidefinite programming
type: Item
instance of: scholarly article
title: On the superlinear local convergence of a penalty-free method for nonlinear semidefinite programming
zbMATH Open document ID: 1343.90060
author: Qi Zhao
author: Zhongwen Chen
published in: Journal of Computational and Applied Mathematics
publication date: 2016-08-16T00:00:00Z
Mathematics Subject Classification ID: 90C22
Mathematics Subject Classification ID: 65K05
zbMATH DE Number: 6617287
zbMATH Keywords: nonlinear semidefinite programming
zbMATH Keywords: second order correction
zbMATH Keywords: penalty-free method
zbMATH Keywords: global convergence
zbMATH Keywords: local convergence
describes a project that uses: PENNON
describes a project that uses: COMPleib
MaRDI profile type: Publication
full work available at URL: j.cam.2016.05.007
OpenAlex ID: W2405543709
cites work: Fixed-orderH? control design via a partially augmented Lagrangian method
cites work: Sequential semidefinite program for maximum robustness design of structures under load uncertainty
cites work: Optimal design of trusses under a nonconvex global buckling constraint
cites work: Robust Control via Sequential Semidefinite Programming
cites work: Constraint Nondegeneracy, Strong Regularity, and Nonsingularity in Semidefinite Programming
cites work: The Strong Second-Order Sufficient Condition and Constraint Nondegeneracy in Nonlinear Semidefinite Programming and Their Implications
cites work: Penalty/Barrier multiplier algorthm for semidefinit programming∗
cites work: PENNON: A code for convex nonlinear and semidefinite programming
cites work: An augmented Lagrangian method for a class of LMI-constrained problems in robust control theory
cites work: A primal-dual interior point method for nonlinear semidefinite programming
cites work: A Global Algorithm for Nonlinear Semidefinite Programming
cites work: On the Global Convergence of a Filter--SQP Algorithm
cites work: A filter algorithm for nonlinear semidefinite programming
cites work: A Penalty-Free Method with Trust Region for Nonlinear Semidefinite Programming
cites work: Global and local convergence of a penalty-free method for nonlinear programming
cites work: A penalty-free method with line search for nonlinear equality constrained optimization
cites work: Nonlinear semidefinite programming: sensitivity, convergence, and an application in passive reduced-order modeling
cites work: A sensitivity result for quadratic semidefinite programs with an application to a sequential quadratic semidefinite programming algorithm
cites work: A note on convergence analysis of an SQP-type method for nonlinear semidefinite programming
cites work: Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
cites work: Line Search Filter Methods for Nonlinear Programming: Local Convergence
cites work: A homotopy method for nonlinear semidefinite programming
DOI: 10.1016/J.CAM.2016.05.007
description: scientific article; zbMATH DE number 6617287