Calmness and exact penalization in vector optimization with cone constraints
From MaRDI portal
Publication:853669
Recommendations
- Calmness and exact penalization for constrained vector set-valued optimization problems
- Calmness and exact penalization in vector optimization under nonlinear perturbations
- Calmness and exact penalization in constrained scalar set-valued optimization
- Calmness, stability and exact penalty function for vector optimization problems of set-valued maps
- Optimality conditions for vector optimization problems
Cites work
- A Unified Augmented Lagrangian Approach to Duality and Exact Penalization
- An Exact Penalization Viewpoint of Constrained Optimization
- An Existence Theorem in Vector Optimization
- Calmness and Exact Penalization
- Decreasing Functions with Applications to Penalization
- Exact penalty functions and stability in locally Lipschitz programming
- First and second order analysis of nonlinear semidefinite programs
- scientific article; zbMATH DE number 77999 (Why is no real title available?)
- scientific article; zbMATH DE number 1243473 (Why is no real title available?)
- scientific article; zbMATH DE number 3307153 (Why is no real title available?)
- Lagrange-type functions in constrained non-convex optimization.
- Mathematical Programs with Equilibrium Constraints
- Multiobjective programming and penalty functions
- Nonlinear Lagrangian for Multiobjective Optimization and Applications to Duality and Exact Penalization
- OPTIMALITY CONDITIONS AND APPROXIMATE OPTIMALITY CONDITIONS IN LOCALLY LIPSCHITZ VECTOR OPTIMIZATION
- Optimization and nonsmooth analysis
Cited in
(30)- A penalty method for rank minimization problems in symmetric matrices
- Exact penalization and necessary optimality conditions for multiobjective optimization problems with equilibrium constraints
- Calmness and exact penalization in constrained scalar set-valued optimization
- Calmness in optimization problems with equality constraints
- 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
- Exact penalization in stochastic programming -- calmness and constraint qualification
- Exactness and algorithm of an objective penalty function
- Calm minima in parameterized finite-dimensional optimization
- A unifying theory of exactness of linear penalty functions
- Calmness and exact penalization for constrained vector set-valued optimization problems
- Connections among constrained continuous and combinatorial vector optimization
- On calmness conditions in convex bilevel programming
- Calmness and Exact Penalization
- A Proximal-Type Method for Convex Vector Optimization Problem in Banach Spaces
- scientific article; zbMATH DE number 77999 (Why is no real title available?)
- Calmness and exact penalization in vector optimization under nonlinear perturbations
- Calmness, stability and exact penalty function for vector optimization problems of set-valued maps
- Lagrange Multipliers and Calmness Conditions of Order p
- Calibration and convex programming: Two approaches to one problem
- Multiobjective optimization with least constraint violation: optimality conditions and exact penalization
- Further study on the Levitin-Polyak well-posedness of constrained convex vector optimization problems
- First- and second-order optimality conditions of nonsmooth sparsity multiobjective optimization via variational analysis
- Image regularity conditions for nonconvex multiobjective optimization problems with applications
- Calmness of efficient solution maps in parametric vector optimization
- A non-monotone proximal gradient algorithm for solving nonsmooth multiobjective optimization problems with an extending application to robust multiobjective optimization
- A proximal gradient-based ZH-type nonmonotone trust region method for nonsmooth composite multiobjective optimization
- Convergence analysis of a class of penalty methods for vector optimization problems with cone constraints
- Approximate generalized proximal-type method for convex vector optimization problem in Banach spaces
- Exact penalty functions and calmness for mathematical programming under nonlinear perturbations
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)
