Directional Levitin-Polyak well-posedness for optimization problems and variational inequalities
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 1099082 (Why is no real title available?)
- scientific article; zbMATH DE number 3257595 (Why is no real title available?)
- A Characterization of Well-Posed Optimal Control Systems
- A characterization of well-posed minimum problems in a complete metric space
- A new notion of error bounds: necessary and sufficient conditions
- A new type of directional regularity for mappings and applications to optimization
- About well-posed optimization problems for functionals in metric spaces
- An Approximation Scheme for the Minimum Time Function
- An invariant-point theorem in Banach space with applications to nonconvex optimization
- Applications of variational analysis to a generalized Fermat-Torricelli problem
- Directional Pareto efficiency: concepts and optimality conditions
- Directional variational principles and applications to the existence study in optimization
- Discontinuous but Well‐Posed Optimization Problems
- Exact penalization and optimality conditions for approximate directional minima
- Generalized Levitin--Polyak Well-Posedness in Constrained Optimization
- Levitin-Polyak well-posedness by perturbations of inverse variational inequalities
- Levitin-Polyak well-posedness of constrained vector optimization problems
- Levitin-Polyak well-posedness of variational inequalities
- Limiting subgradients of minimal time functions in Banach spaces
- Minimal time function with respect to a set of directions: basic properties and applications
- Numerical Optimization
- On global well-posedness of semi-infinite set optimization problems
- On the stability of the directional regularity
- On the stability of the functional optimization problem
- On the variational principle
- On the well-posedness concept in the sense of Tykhonov
- Pointwise well-posedness in set optimization with cone proper sets
- Stability and Well-Posedness in Linear Semi-Infinite Programming
- Stability of minimality and criticality in directional set-valued optimization problems
- Strict directional solutions in vectorial problems: necessary optimality conditions
- Subdifferential properties for a class of minimal time functions with moving target sets in normed spaces
- Subdifferentials of a minimum time function in Banach spaces
- Subgradients of Minimal Time Functions Under Minimal Requirements
- Techniques of variational analysis
- The Tikhonov regularization for vector equilibrium problems
- The subgradient formula for the minimal time function in the case of constant dynamics in Hilbert space
- Tykhonov well-posedness for lexicographic equilibrium problems
- Typical convex program is very well posed
- Variational analysis of directional minimal time functions and applications to location problems
- Well posedness in vector optimization problems and vector variational inequalities
- Well-posed equilibrium problems
- Well-posedness for optimization problems with constraints defined by variational inequalities having a unique solution
- Well-posedness of a parametric traffic network problem
- Well-posedness of minimal time problems with constant dynamics in Banach spaces
- Well-posedness under relaxed semicontinuity for bilevel equilibrium and optimization problems with equilibrium constraints
This page was built for publication: Directional Levitin-Polyak well-posedness for optimization problems and variational inequalities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6928811)
