Optimization Online


Optimality conditions and global convergence for nonlinear semidefinite programming

Roberto Andreani(andreani***at***ime.unicamp.br)
Gabriel Haeser(ghaeser***at***ime.usp.br)
Daiana S. Viana(daiana***at***ime.usp.br)

Abstract: Sequential optimality conditions have played a major role in unifying and extending global convergence results for several classes of algorithms for general nonlinear optimization. In this paper, we extend theses concepts for nonlinear semidefinite programming. We define two sequential optimality conditions for nonlinear semidefinite programming. The first is a natural extension of the so-called Approximate-Karush-Kuhn-Tucker (AKKT), well known in nonlinear optimization. The second one, called Trace-AKKT (TAKKT), is more natural in the context of semidefinite programming as the computation of eigenvalues is avoided. We propose an Augmented Lagrangian algorithm that generates these types of sequences and new constraint qualifications are proposed, weaker than previously considered ones, which are sufficient for the global convergence of the algorithm to a stationary point.

Keywords: Nonlinear semidefinite programming, Optimality conditions, Constraint qualifications, Practical algorithms

Category 1: Linear, Cone and Semidefinite Programming (Semi-definite Programming )

Category 2: Nonlinear Optimization


Download: [PDF]

Entry Submitted: 03/13/2018
Entry Accepted: 03/13/2018
Entry Last Modified: 03/13/2018

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Optimization Society