Abstract subdifferentials and some characterizations of optimal solutions
We introduce and study the subdifferential of a function at a point, with respect to a primal-dual pair of optimization problems, which encompasses, as particular cases, several known concepts of subdifferential. We give a characterization of optimal solutions of the primal problem, in terms of abstract Lagrangians, and a simultaneous characterization of optimal solutions and strong duality, with the aid of abstract subdifferentials. We give some applications to unperturbational Lagrangian duality and unperturbational surrogate duality.
- scientific article; zbMATH DE number 841071
- Optimization by level set methods v:duality theorems for perturbed optimization problems2
- A general theory of dual optimization problems
- Directional subdifferentials and optimality conditions
- Some further relations between unperturbational and perturbational dual optimization problems
- A general theory of dual optimization problems
- An Extension of Duality-Stability Relations to Nonconvex Optimization Problems
- scientific article; zbMATH DE number 3465097 (Why is no real title available?)
- Optimization by level set methods. III: Characterizations of solutions in the presence of duality
- Surrogate conjugate functionals and surrogate convexity
- Surrogate Mathematical Programming
- Nonintegrability of the classical Zeeman Hamiltonian
- Exact characterization for subdifferentials of a special optimal value function
- Some further relations between unperturbational and perturbational dual optimization problems
- Dualization of subgradient conditions for optimality
- A general theory of dual optimization problems. II: On the perturbational dual problem corresponding to an unperturbational dual problem
This page was built for publication: Abstract subdifferentials and some characterizations of optimal solutions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1089608)