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

DOI10.1080/02331938108842721zbMATH Open0516.90066OpenAlexW2130968163MaRDI QIDQ3664844FDOQ3664844

Authors: Sanjo Zlobec, B. 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) Methods of successive quadratic programming type (90C55) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37) Numerical methods involving duality (49M29)

Cited In (6)

• Characterizing optimality in mathematical programming models
• Characterizing an optimal input in perturbed convex programming
• Generalized convexity in nondifferentiable programming
• On minimization subject to cone constraints
• Survey of input optimization¹
• Title not available (Why is that?)

This page was built for publication: Stabilization and determination of the set of minimal binding constraints in convex programming¹

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3664844)