Stabilization and determination of the set of minimal binding constraints in convex programming1
From MaRDI portal
Publication:3664844
DOI10.1080/02331938108842721zbMath0516.90066MaRDI QIDQ3664844
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
stabilization; Pareto optimum; faithfully convex functions; convex differentiable functions; augmented restricted Lagrangians; minimal index set of binding constraints
65K05: Numerical mathematical programming methods
90C25: Convex programming
90C30: Nonlinear programming
49M29: Numerical methods involving duality
49M37: Numerical methods based on nonlinear programming
90C55: Methods of successive quadratic programming type
Related Items
Characterizing an optimal input in perturbed convex programming, Characterizing optimality in mathematical programming models, On minimization subject to cone constraints, Generalized convexity in nondifferentiable programming, Survey of input optimization1, Unnamed Item