ε-Optimal solutions in nondifferentiable convex programming and some related questions
From MaRDI portal
Publication:3959749
DOI10.1007/BF02594782zbMath0495.90067OpenAlexW1997964370MaRDI QIDQ3959749
Van Hien Nguyen, Jean Jacques Strodiot, Norbert Heukemes
Publication date: 1983
Published in: Mathematical Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02594782
nonsmooth optimizationlinear equality constraintsepsilon-subgradientabstract constraintsbundle algorithmKuhn-Tucker type conditionepsilon-optimality conditionsepsilon-subdifferentialepsilon-optimal solutionsnondifferentiable convex objective functionnondifferentiable convex inequality constraintsMax functions
Related Items (61)
Epsilon-solutions and epsilon-supports ⋮ On \(\epsilon\)-solutions for convex optimization problems with uncertainty data ⋮ \(\varepsilon\)-optimality for multiobjective programming on a Banach space ⋮ Approximate Euler-Lagrange inclusion, approximate transversality condition, and sensitivity analysis of convex parametric problems of calculus of variations ⋮ ε-Pareto Optimality Conditions for Convex Multiobjective Programming via Max Function ⋮ A subgradient selection method for minimizing convex functions subject to linear constraints ⋮ Survey of Bundle Methods for Nonsmooth Optimization ⋮ Optimality conditions of quasi $(\alpha,\varepsilon)$-solutions and approximate mixed type duality for DC composite optimization problems ⋮ An approach to characterizing \(\epsilon\)-solution sets of convex programs ⋮ On approximate efficiency for nonsmooth robust vector optimization problems ⋮ A method of linearizations for linearly constrained nonconvex nonsmooth minimization ⋮ Algorithms for the solution of stochastic dynamic minimax problems ⋮ APPROXIMATE EFFICIENCY FOR n-SET MULTIOBJECTIVE FRACTIONAL PROGRAMMING ⋮ Optimality conditions of approximate solutions for nonsmooth semi-infinite programming problems ⋮ Strict approximate duality in vector spaces ⋮ ∊-gradients pour les ponctions localements lipschitziennes et applications ⋮ On approximate solutions for robust convex semidefinite optimization problems ⋮ Bundle-based decomposition: Conditions for convergence ⋮ Asymptotic dual conditions characterizing optimality for infinite convex programs ⋮ Subdifferential calculus without qualification conditions, using approximate subdifferentials: A survey ⋮ Optimality conditions for approximate proper solutions in multiobjective optimization with polyhedral cones ⋮ Subgradient projection algorithms for constrained nonsmooth optimization II: nonlinear constraints† ⋮ On approximate optimality conditions for robust multi-objective convex optimization problems ⋮ A characterization of the $\varepsilon$-normal set and its application in robust convex optimization problems ⋮ An active set method for solving linearly constrained nonsmooth optimization problems ⋮ On \(\varepsilon\)-optimality conditions for multiobjective fractional optimization problems ⋮ An ε-lagrange multiplier rule for a mathematical programming problem on banacch spaces∗ ⋮ A successive quadratic programming method for a class of constrained nonsmooth optimization problems ⋮ \(\varepsilon\)-optimality conditions for composed convex optimization problems ⋮ Approximate saddle points for constrained vector-valued games. ⋮ \(\varepsilon\)-optimality criteria for convex programming problems via exact penalty functions ⋮ \(\varepsilon \)-duality theorems for convex semidefinite optimization problems with conic constraints ⋮ ε-Optimality Conditions for Vector Optimization Problems with Set-Valued Maps ⋮ \(\epsilon \)-optimal solutions in nonconvex semi-infinite programs with support functions ⋮ Approximate duality ⋮ A property of efficient and \(\varepsilon\)-efficient solutions in vector optimization ⋮ Multiplier rules and saddle-point theorems for Helbig's approximate solutions in convex Pareto problems ⋮ Unnamed Item ⋮ \(\epsilon\)-duality of nondifferentiable nonconvex multiobjective programming ⋮ Sequential optimality conditions for multiobjective fractional programming problems ⋮ Approximate Saddle Point and Duality for Multiobjective n-Set Optimization ⋮ \(\varepsilon\)-optimality and duality for multiobjective fractional programming ⋮ Duality for \(\varepsilon \)-variational inequality ⋮ \(\varepsilon\)-properly efficient solutions to nondifferentiable multiobjective programming problems ⋮ An implementation of a reduced subgradient method via Luenberger-Mokhtar variant ⋮ Conditional subgradient optimization -- theory and applications ⋮ On approximate solutions of nondifferentiable vector optimization problems with cone-convex objectives ⋮ Approximate first-order and second-order directional derivatives of a marginal function in convex optimization ⋮ Approximate saddle-point theorems in vector optimization ⋮ \(\varepsilon \)-optimality and \(\varepsilon \)-Lagrangian duality for a nonconvex programming problem with an infinite number of constraints ⋮ Characterizations of robustε-quasi optimal solutions for nonsmooth optimization problems with uncertain data ⋮ A chain rule for \(\varepsilon\)-subdifferentials with applications to approximate solutions in convex Pareto problems ⋮ Necessary optimality conditions and saddle points for approximate optimization in Banach space ⋮ Sequential Lagrange multiplier condition forϵ-optimal solution in convex programming ⋮ On approximate solutions for robust semi-infinite multi-objective convex symmetric cone optimization ⋮ Revisiting augmented Lagrangian duals ⋮ ε-approximate solutions in multiobjective optimization ⋮ Reduced subgradient bundle method for linearly constrained non-smooth non-convex problems ⋮ Best approximation and optimization ⋮ Descent algorithm for a class of convex nondifferentiable functions ⋮ On \(\epsilon\)-solutions for robust fractional optimization problems
Cites Work
- Test examples for nonlinear programming codes
- Lipschitz $r$-continuity of the approximative subdifferential of a convex function.
- Linearly constrained minimax optimization
- An Algorithm for Constrained Optimization with Semismooth Functions
- The fixed point approach to nonlinear programming
- A stable method for solving certain constrained least squares problems
- Convex Analysis
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: ε-Optimal solutions in nondifferentiable convex programming and some related questions
