2004•SIAM Journal on OptimizationRequires access

A Global Algorithm for Nonlinear Semidefinite Programming

Rafael Corrêa, Héctor Ramírez

Abstract

In this paper we propose a global algorithm for solving nonlinear semidefinite programming problems. This algorithm, inspired by the classic SQP (sequentially quadratic programming) method, modifies the S-SDP (sequentially semidefinite programming) local method by using a nondifferentiable merit function combined with a line search strategy.

About this research paper

What this paper is about

Why it matters

OpenAlex reports 109 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Key concepts: Semidefinite programming, Semidefinite embedding, Sequential quadratic programming, Mathematics, Quadratically constrained quadratic program, Nonlinear programming, Line search, Mathematical optimization