Study of a special nonlinear problem arising in convex semi-infinite programming
type: Item
instance of: scholarly article
title: Study of a special nonlinear problem arising in convex semi-infinite programming
zbMATH Open document ID: 1201.90195
published in: Journal of Mathematical Sciences (New York)
publication date: 2010-01-19T00:00:00Z
review text: The authors consider convex semi-infinite programming (SIP) problems and present implicit optimality conditions by using a corresponding auxiliary nonlinear programming problem. This latter problem has a particular structure and it is constructed by using the so-called immobile indices and their immobility orders of the original SIP problem. Finally, a discussion of several optimality conditions for convex SIP problems is given, where, in particular, the case without Slater condition is considered.
reviewed by: Jan-Joachim Rückmann
Mathematics Subject Classification ID: 90C34
Mathematics Subject Classification ID: 90C25
Mathematics Subject Classification ID: 49M37
Mathematics Subject Classification ID: 90C46
zbMATH DE Number: 5660166
zbMATH Keywords: convex semi-infinite programming
zbMATH Keywords: optimality conditions
zbMATH Keywords: immobile index
zbMATH Keywords: immobility orders
author: O. I. Kostyukova
author: Tatiana V. Tchemisova
author: S. A. Yermalinskaya
MaRDI profile type: Publication
full work available at URL: s10958-009-9608-7
OpenAlex ID: W2007311436
Wikidata QID: Q57677671
cites work: Necessary extremum conditions for smooth anormal problems with equality- and inequality-type constraints
cites work: Q3134873
cites work: Optimality conditions for convex semi-infinite programming problems
cites work: Q4503250
cites work: Necessary and sufficient constraint qualifications for solvability of systems of infinite convex inequalities
cites work: Q4161092
cites work: Semi-Infinite Programming: Theory, Methods, and Applications
cites work: Second order optimality conditions for generalized semi-infinite programming problems
cites work: New Sequential Lagrange Multiplier Conditions Characterizing Optimality without Constraint Qualification for Convex Programs
cites work: Q3542466
cites work: High-Order Approximations and Generalized Necessary Conditions for Optimality
cites work: Constraint qualifications for semi-infinite systems of convex inequalities
cites work: Q3840143
cites work: First-order optimality conditions in generalized semi-infinite programming
cites work: A globally convergent SQP method for semi-infinite nonlinear optimization
cites work: Sequential Convex Subdifferential Calculus and Sequential Lagrange Multipliers
cites work: Q3659045
DOI: 10.1007/S10958-009-9608-7
Recommended article: Q5750724
Recommended article: Q2953986
Recommended article: Q3106488
Recommended article: Q4358908
Recommended article: On solving convex quadratic semi-infinite programming probelms
Recommended article: An Unconstrained Convex Programming Approach to Linear Semi-Infinite Programming
Recommended article: On regularity and optimality in nonlinear semi-infinite programming.
Recommended article: About a special class of nonconvex optimization problems
Recommended article: Q3586791
Recommended article: Optimality conditions for semi-infinite programming problems involving generalized convexity
description: scientific article; zbMATH DE number 5660166