An approximate exact penalty in constrained vector optimization on metric spaces
The author studies the following vector optimization problem (P): minimize \(F(x)\) subject to \(\phi(x)=0, x\in X\), where \(F\) is a lower semi-continuous function from a complete metric space \((X, \rho)\) to a normed space \(Y\), partially ordered by a closed, convex and pointed cone \(Y_+\) with a nonempty interior, \(\phi\) is a positive function on \(X\). The main result of this paper states that if \(x_0\) is an \(\epsilon\)-solution of the unconstrained problem (P\(\lambda\)): minimize \(F(x)+\lambda \phi(x) e\) on \(X\), where \(\lambda \geqq \lambda_0\) for some \(\lambda_0\geqq 0\), \(e\in\int(Y_+)\), then there exists an \(\epsilon\)-solution of (P\(\lambda\)) which is feasible for (P) and satisfies \(F(z_0)\leq F(x_0)+\lambda \phi(x_0)e\) and \(\rho(x_0,z_0)\leq \epsilon\). It is regrettable that relevent references on vector optimization were not used, which should help to simplify certain proofs.
- \(\varepsilon\)-optimality criteria for vector minimization problems via exact penalty functions
- An approximate exact penalty for vector inequality-constrained minimization problems
- Existence of exact penalty for constrained optimization problems in metric spaces
- Existence and optimality conditions for approximate solutions to vector optimization problems
- An exact penalty approach to constrained minimization problems on metric spaces
- A Sufficient Condition for Exact Penalty in Constrained Optimization
- A Unified Augmented Lagrangian Approach to Duality and Exact Penalization
- An augmented penalty function method with penalty parameter updates for nonconvex optimization
- An Exact Penalization Viewpoint of Constrained Optimization
- Asymptotic Analysis for Penalty and Barrier Methods in Variational Inequalities
- Characterizations for perturbed exact penalty functions
- Characterizations of error bounds for lower semicontinuous functions on metric spaces
- Conditions for an extremum in metric spaces
- Decreasing Functions with Applications to Penalization
- Duality and exact penalization for general augmented Lagrangians
- Exact penalization via dini and hadamard conditional derivatives
- Exact penalty functions and calmness for mathematical programming under nonlinear perturbations
- Exact Penalty Functions in Constrained Optimization
- Existence of Approximate Exact Penalty in Constrained Optimization
- scientific article; zbMATH DE number 3249572 (Why is no real title available?)
- Inexact proximal point methods in metric spaces
- Non-Linear Programming Via Penalty Functions
- On the variational principle
- Optimization and nonsmooth analysis
- Optimization on metric and normed spaces
- Penalty and Barrier Methods: A Unified Framework
- Penalty functions with a small penalty parameter
- Survey of penalty, exact-penalty and multiplier methods from 1968 to 1993
- The exact penalty principle
- The use of grossone in mathematical programming and operations research
- \(\varepsilon\)-optimality criteria for vector minimization problems via exact penalty functions
- Vectorial penalization for generalized functional constrained problems
- An exact penalty approach to constrained minimization problems on metric spaces
- Existence of exact penalty for constrained optimization problems in metric spaces
- A strong metric subregularity analysis of nonsmooth mappings via steepest displacement rate
- Scalarization of constraints system in some vector optimization problems and applications
- Constrained Minima and Lipschitzian Penalties in Metric Spaces
- An approximate exact penalty for vector inequality-constrained minimization problems
- On exact penalties for constrained optimization problems in metric spaces
- Convergence analysis of a class of penalty methods for vector optimization problems with cone constraints
This page was built for publication: An approximate exact penalty in constrained vector optimization on metric spaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q467460)
