On duality theory for non-convex semidefinite programming
type: Item
instance of: scholarly article
title: On duality theory for non-convex semidefinite programming
zbMATH Open document ID: 1269.90075
author: Chengjin Li
author: Raimundo J. B. de Sampaio
author: Wenyu Sun
published in: Annals of Operations Research
publication date: 2011-11-17T00:00:00Z
Mathematics Subject Classification ID: 90C22
Mathematics Subject Classification ID: 90C46
zbMATH DE Number: 5973834
zbMATH Keywords: nonconvex semidefinite programming
zbMATH Keywords: duality
zbMATH Keywords: convex-like function
zbMATH Keywords: invex function
MaRDI profile type: Publication
full work available at URL: s10479-011-0861-z
OpenAlex ID: W1972790638
cites work: Sequential Lagrangian conditions for convex programs with applications to semidefinite programming
cites work: Q5547717
cites work: Duality theories in nonlinear semidefinite programming
cites work: Successive linearization methods for nonlinear semidefinite programs
cites work: Q3609101
cites work: Q5319006
cites work: On filter-successive linearization methods for nonlinear semidefinite programming
cites work: An equivalency condition of nonsingularity in nonlinear semidefinite programming
cites work: The Strong Second-Order Sufficient Condition and Constraint Nondegeneracy in Nonlinear Semidefinite Programming and Their Implications
cites work: A Squared Smoothing Newton Method for Nonsmooth Matrix Equations and Its Applications in Semidefinite Optimization Problems
cites work: The rate of convergence of the augmented Lagrangian method for nonlinear semidefinite programming
cites work: A class of nonconvex functions and mathematical programming
cites work: Characterizations and applications of prequasi-invex functions.
DOI: 10.1007/S10479-011-0861-Z
description: scientific article; zbMATH DE number 5973834