Text

Necessary and Sufficient Optimality Conditions in DC Semi-infinite Programming

This paper deals with particular families of DC optimization problems involving suprema of convex functions. We show that the specific structure of this type of function allows us to cover a variety of problems in nonconvex programming. Necessary and sufficient optimality conditions for these families of DC optimization problems are established, where some of these structural features are conveniently exploited. More precisely, we derive necessary and sufficient conditions for (global and local) optimality in DC semi-infinite programming and DC cone-constrained optimization, under natural constraint qualifications. Finally, a penalty approach to DC abstract programming problems is developed in the last section.


Read More: https://epubs.siam.org/doi/abs/10.1137/19M1303320

Ketersediaan

Informasi Detail

Judul Seri

SIAM JOURNAL ON OPTIMIZATION; Vol.31 No.1 January-March 2021

No. Panggil

-

Penerbit

: .,

Deskripsi Fisik

p. 837 - 865

Bahasa

English

ISBN/ISSN

-

Klasifikasi

-

Tipe Isi

-

Tipe Media

-

Tipe Pembawa

-

Edisi

-

Subjek

SEMI-INFINITE PROGRAMMING
DC FUNCTIONS
SUPREMUM FUNCTION
CONE-CONSTRAINT PROGRAMMING

Info Detail Spesifik

-

Pernyataan Tanggungjawab

Rafael Correa, M. A. Lopez, Pedro Pérez-Aros

Versi lain/terkait

Lampiran Berkas

Komentar