Calmness and exact penalization in vector optimization with cone constraints

DOI10.1007/s10589-006-6441-5zbMath1129.90343OpenAlexW2046807944MaRDI QIDQ853669

Xiao Qi Yang, Kok Lay Teo, Xue Xiang Huang

Publication date: 17 November 2006

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10589-006-6441-5

zbMATH Keywords

calmnessefficient solutionexact penalizationweakly efficient solutionnormal Lagrange multipliervector optimization with cone constraints

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Sensitivity, stability, parametric optimization (90C31)

Related Items (14)

A penalty method for rank minimization problems in symmetric matrices ⋮ Convergence analysis of a class of penalty methods for vector optimization problems with cone constraints ⋮ Exactness and algorithm of an objective penalty function ⋮ Multiobjective optimization with least constraint violation: optimality conditions and exact penalization ⋮ Characterizations of the nonemptiness and compactness for solution sets of convex set-valued optimization problems ⋮ Levitin-Polyak well-posedness in vector quasivariational inequality problems with functional constraints ⋮ Calmness and exact penalization in vector optimization under nonlinear perturbations ⋮ Further study on the Levitin-Polyak well-posedness of constrained convex vector optimization problems ⋮ Connections among constrained continuous and combinatorial vector optimization ⋮ Calmness and exact penalization in constrained scalar set-valued optimization ⋮ Approximate generalized proximal-type method for convex vector optimization problem in Banach spaces ⋮ Exact penalty functions and calmness for mathematical programming under nonlinear perturbations ⋮ A Proximal-Type Method for Convex Vector Optimization Problem in Banach Spaces ⋮ A unifying theory of exactness of linear penalty functions

Cites Work

• Multiobjective programming and penalty functions
• First and second order analysis of nonlinear semidefinite programs
• Lagrange-type functions in constrained non-convex optimization.
• Calmness and Exact Penalization
• Optimization and nonsmooth analysis
• Exact penalty functions and stability in locally Lipschitz programming
• An Exact Penalization Viewpoint of Constrained Optimization
• An Existence Theorem in Vector Optimization
• OPTIMALITY CONDITIONS AND APPROXIMATE OPTIMALITY CONDITIONS IN LOCALLY LIPSCHITZ VECTOR OPTIMIZATION
• Nonlinear Lagrangian for Multiobjective Optimization and Applications to Duality and Exact Penalization
• Decreasing Functions with Applications to Penalization
• A Unified Augmented Lagrangian Approach to Duality and Exact Penalization
• Mathematical Programs with Equilibrium Constraints
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Calmness and exact penalization in vector optimization with cone constraints