Necessary and sufficient constraint qualification for surrogate duality
type: Item
instance of: scholarly article
title: Necessary and sufficient constraint qualification for surrogate duality
zbMATH Open document ID: 1243.90242
author: Satoshi Suzuki
author: Daishi Kuroiwa
published in: Journal of Optimization Theory and Applications
publication date: 2012-05-08T00:00:00Z
review text: The authors investigate necessary and sufficient constraint qualifications for surrogate duality closely related with ones for Lagrange-type dualities, in comparison with such as these conditions in the usual mathematical programming. Reviewer's remark: This paper is also important for proper numerical studies.
reviewed by: Vasile Postolică
Mathematics Subject Classification ID: 90C46
Mathematics Subject Classification ID: 90C48
zbMATH DE Number: 6031728
zbMATH Keywords: mathematical programming
zbMATH Keywords: constraint qualification
zbMATH Keywords: surrogate duality
MaRDI profile type: Publication
full work available at URL: s10957-011-9893-4
OpenAlex ID: W1998988522
cites work: Conjugate duality in convex optimization
cites work: An alternative formulation for a new closed cone constraint qualification
cites work: Necessary and sufficient constraint qualifications for solvability of systems of infinite convex inequalities
cites work: Constraint qualifications characterizing Lagrangian duality in convex optimization
cites work: A Multiphase-Dual Algorithm for the Zero-One Integer Programming Problem
cites work: The Generalized Penalty-Function/Surrogate Model
cites work: Surrogate Mathematical Programming
cites work: Q4401741
cites work: Quasi-Convex Programming
cites work: Surrogate Programming and Multipliers in Quasi-convex Programming
cites work: Characterizing Set Containments Involving Infinite Convex Constraints and Reverse-Convex Constraints
cites work: A new geometric condition for Fenchel's duality in infinite dimensional spaces
cites work: Generalized Fenchel's conjugation formulas and duality for abstract convex functions
cites work: Optimality conditions and the basic constraint qualification for quasiconvex programming
cites work: Constraint Qualifications for Convex Inequality Systems with Applications in Constrained Optimization
cites work: New regularity conditions for strong and total Fenchel-Lagrange duality in infinite dimensional spaces
cites work: On regularity for constrained extremum problems. I: Sufficient optimality conditions
cites work: On regularity for constrained extremum problems. II: Necessary optimality conditions
cites work: On set containment characterization and constraint qualification for quasiconvex programming
DOI: 10.1007/S10957-011-9893-4
description: scientific article; zbMATH DE number 6031728