Calmness and exact penalization in vector optimization with cone constraints
DOI10.1007/S10589-006-6441-5zbMATH Open1129.90343OpenAlexW2046807944MaRDI QIDQ853669FDOQ853669
Xiao Qi Yang, Kok Lay Teo, Xuexiang 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
efficient solutionweakly efficient solutioncalmnessexact penalizationnormal Lagrange multipliervector optimization with cone constraints
Multi-objective and goal programming (90C29) Sensitivity, stability, parametric optimization (90C31)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Optimization and nonsmooth analysis
- Mathematical Programs with Equilibrium Constraints
- Multiobjective programming and penalty functions
- OPTIMALITY CONDITIONS AND APPROXIMATE OPTIMALITY CONDITIONS IN LOCALLY LIPSCHITZ VECTOR OPTIMIZATION
- Calmness and Exact Penalization
- An Exact Penalization Viewpoint of Constrained Optimization
- First and second order analysis of nonlinear semidefinite programs
- Lagrange-type functions in constrained non-convex optimization.
- A Unified Augmented Lagrangian Approach to Duality and Exact Penalization
- Exact penalty functions and stability in locally Lipschitz programming
- Decreasing Functions with Applications to Penalization
- An Existence Theorem in Vector Optimization
- Nonlinear Lagrangian for Multiobjective Optimization and Applications to Duality and Exact Penalization
Cited In (25)
- Image regularity conditions for nonconvex multiobjective optimization problems with applications
- Calmness in optimization problems with equality constraints
- Calibration and convex programming: Two approaches to one problem
- A penalty method for rank minimization problems in symmetric matrices
- Exact penalty functions and calmness for mathematical programming under nonlinear perturbations
- Convergence analysis of a class of penalty methods for vector optimization problems with cone constraints
- Calmness and exact penalization in vector optimization under nonlinear perturbations
- Title not available (Why is that?)
- Approximate generalized proximal-type method for convex vector optimization problem in Banach spaces
- Exact penalization in stochastic programming -- calmness and constraint qualification
- Calmness and exact penalization for constrained vector set-valued optimization problems
- Multiobjective optimization with least constraint violation: optimality conditions and exact penalization
- Levitin-Polyak well-posedness in vector quasivariational inequality problems with functional constraints
- Connections among constrained continuous and combinatorial vector optimization
- On calmness conditions in convex bilevel programming
- Exactness and algorithm of an objective penalty function
- Calmness of efficient solution maps in parametric vector optimization
- Further study on the Levitin-Polyak well-posedness of constrained convex vector optimization problems
- A non-monotone proximal gradient algorithm for solving nonsmooth multiobjective optimization problems with an extending application to robust multiobjective optimization
- First- and second-order optimality conditions of nonsmooth sparsity multiobjective optimization via variational analysis
- A unifying theory of exactness of linear penalty functions
- Calmness and exact penalization in constrained scalar set-valued optimization
- A Proximal-Type Method for Convex Vector Optimization Problem in Banach Spaces
- Characterizations of the nonemptiness and compactness for solution sets of convex set-valued optimization problems
- Calm minima in parameterized finite-dimensional optimization
This page was built for publication: Calmness and exact penalization in vector optimization with cone constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q853669)
