The -strategy in variational analysis: illustration with the closed convexification of a function
The paper is devoted to analysing the possible relationship between the minimizers of a general variational (or optimization) problem (actually the \(\varepsilon\)-minimizers) and those of a relaxed version of it (by relaxation the authors mean here closed-convexification of the objective function). Problems of interest are those which do not have solutions necessarily but do have approximate solutions (or solutions within \(\varepsilon >0\)). The authors present how to recover all the (exact) minimizers of the relaxed version of the original problem in terms of the \(\varepsilon\)-minimizers of the original problem. Section 1 presents what the authors call the \(\varepsilon\)-strategy in mathematics, and show how to benefit from \(\varepsilon\)-perturbations of a given problem. Section 2 is devoted to the links between a general function \(J\) and its closed convex hull \(\overline{\text{co}}J\) in which it gives ways to derive \(\operatorname{argmin} (\overline{\text{co}}J)\) from the \(\varepsilon\)-\(\operatorname{argmin}(J)\)'s. Section 3 is devoted to some applications of results of the mentioned affirmation to some Hilbertian approximation-minimization problems.
- A formula for the set of optimal solutions of a relaxed minimization problem. Applications to subdifferential calculus
- Approximated Convex Envelope of a Function
- Chebyshev sets vs convex sets: the situation from the perspective of convex nonsmooth analysis
- Convex Optimization and the Epi-Distance Topology
- Direct methods in the calculus of variations
- scientific article; zbMATH DE number 1807400 (Why is no real title available?)
- scientific article; zbMATH DE number 3766391 (Why is no real title available?)
- scientific article; zbMATH DE number 1113627 (Why is no real title available?)
- scientific article; zbMATH DE number 1376935 (Why is no real title available?)
- scientific article; zbMATH DE number 5175639 (Why is no real title available?)
- Lipschitz r-continuity of the approximative subdifferential of a convex function.
- Nonconvex minimization problems
- On a problem of H. Berens
- Subdifferential Calculus Rules in Convex Analysis: A Unifying Approach Via Pointwise Supremum Functions
- Subdifferential calculus using -subdifferentials
- Subdifferential calculus without qualification conditions, using approximate subdifferentials: A survey
- Variational Analysis in Sobolev andBVSpaces
- Viscosity Solutions of Hamilton-Jacobi Equations
- What is the Subdifferential of the Closed Convex Hull of a Function?
- What shape is your conjugate? A survey of computational convex analysis and its applications
- When Is a Point x Satisfying ∇f(x) = 0 a Global Minimum of f?
- A primal--dual operation on sets linked with closed convex relaxation processes
- Subdifferential of the closed convex hull of a function and integration with nonconvex data in general normed spaces
- On \(\varepsilon\)-optimal points of convex, closed functions
- scientific article; zbMATH DE number 4117306 (Why is no real title available?)
- An approximate Hahn-Banach theorem for positively homogeneous functions
- -near methods and applications to boundary value problems
- New formulas for the Fenchel subdifferential of the conjugate function
- A characterization of essentially strictly convex functions on reflexive Banach spaces
- Catching-up algorithm with approximate projections for Moreau's sweeping processes
- On epsilon-stability in optimization
- Computing the convex envelope of bivariate piecewise linear-quadratic functions in linear time
- Level sets relaxation, epigraphical relaxation and conditioning in optimization
This page was built for publication: The \(\varepsilon\)-strategy in variational analysis: illustration with the closed convexification of a function
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2275342)
