Stabilization and determination of the set of minimal binding constraints in convex programming1

DOI10.1080/02331938108842721zbMath0516.90066OpenAlexW2130968163MaRDI QIDQ3664844

Sanjo Zlobec, Bruce D.Craven

Publication date: 1981

Published in: Mathematische Operationsforschung und Statistik. Series Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331938108842721

zbMATH Keywords

stabilizationPareto optimumfaithfully convex functionsconvex differentiable functionsaugmented restricted Lagrangiansminimal index set of binding constraints

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Nonlinear programming (90C30) Numerical methods involving duality (49M29) Numerical methods based on nonlinear programming (49M37) Methods of successive quadratic programming type (90C55)

Related Items

Characterizing optimality in mathematical programming models, Survey of input optimization¹, Unnamed Item, On minimization subject to cone constraints, Generalized convexity in nondifferentiable programming, Characterizing an optimal input in perturbed convex programming