2009•Journal of Mathematical Analysis and ApplicationsOpen access

Stable zero duality gaps in convex programming: Complete dual characterisations with applications to semidefinite programs

V. Jeyakumar, Guoyin Li

Open full text 31 citations

Abstract

This record does not include an abstract. Use the full-text link above if available.

Open-access reader

About this research paper

What this paper is about

An abstract is not available in the OpenAlex record for this paper.

Why it matters

OpenAlex reports 31 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.

Key concepts: Duality gap, Perturbation function, Duality (order theory), Strong duality, Mathematics, Weak duality, Wolfe duality, Convex analysis

Back to paper search Browse research topics Original source

Stable zero duality gaps in convex programming: Complete dual characterisations with applications to semidefinite programs — Research Paper | ScholarLens