Pages that link to "Item:Q3959749"
From MaRDI portal
The following pages link to ε-Optimal solutions in nondifferentiable convex programming and some related questions (Q3959749):
Displaying 50 items.
- On \(\epsilon\)-solutions for robust fractional optimization problems (Q261808) (← links)
- On \(\epsilon\)-solutions for convex optimization problems with uncertainty data (Q270047) (← links)
- \(\epsilon \)-optimal solutions in nonconvex semi-infinite programs with support functions (Q536840) (← links)
- Approximate first-order and second-order directional derivatives of a marginal function in convex optimization (Q761248) (← links)
- Best approximation and optimization (Q801499) (← links)
- \(\varepsilon\)-optimality conditions for composed convex optimization problems (Q935086) (← links)
- \(\varepsilon \)-duality theorems for convex semidefinite optimization problems with conic constraints (Q962489) (← links)
- Duality for \(\varepsilon \)-variational inequality (Q1014040) (← links)
- \(\varepsilon \)-optimality and \(\varepsilon \)-Lagrangian duality for a nonconvex programming problem with an infinite number of constraints (Q1028592) (← links)
- A subgradient selection method for minimizing convex functions subject to linear constraints (Q1092621) (← links)
- Strict approximate duality in vector spaces (Q1115349) (← links)
- Bundle-based decomposition: Conditions for convergence (Q1122487) (← links)
- A successive quadratic programming method for a class of constrained nonsmooth optimization problems (Q1174457) (← links)
- \(\varepsilon\)-optimality criteria for convex programming problems via exact penalty functions (Q1199753) (← links)
- Conditional subgradient optimization -- theory and applications (Q1266608) (← links)
- Descent algorithm for a class of convex nondifferentiable functions (Q1321148) (← links)
- Approximate Euler-Lagrange inclusion, approximate transversality condition, and sensitivity analysis of convex parametric problems of calculus of variations (Q1332552) (← links)
- Asymptotic dual conditions characterizing optimality for infinite convex programs (Q1379971) (← links)
- Optimality conditions of approximate solutions for nonsmooth semi-infinite programming problems (Q1660296) (← links)
- On approximate solutions for robust convex semidefinite optimization problems (Q1670443) (← links)
- \(\varepsilon\)-optimality and duality for multiobjective fractional programming (Q1806494) (← links)
- \(\varepsilon\)-properly efficient solutions to nondifferentiable multiobjective programming problems (Q1808441) (← links)
- Approximate saddle-point theorems in vector optimization (Q1821701) (← links)
- \(\varepsilon\)-optimality for multiobjective programming on a Banach space (Q1877027) (← links)
- Algorithms for the solution of stochastic dynamic minimax problems (Q1908531) (← links)
- On \(\varepsilon\)-optimality conditions for multiobjective fractional optimization problems (Q1952121) (← links)
- On approximate solutions for robust semi-infinite multi-objective convex symmetric cone optimization (Q2091085) (← links)
- Revisiting augmented Lagrangian duals (Q2097636) (← links)
- An approach to characterizing \(\epsilon\)-solution sets of convex programs (Q2146365) (← links)
- On approximate efficiency for nonsmooth robust vector optimization problems (Q2153390) (← links)
- Optimality conditions for approximate proper solutions in multiobjective optimization with polyhedral cones (Q2192032) (← links)
- \(\epsilon\)-duality of nondifferentiable nonconvex multiobjective programming (Q2277144) (← links)
- On approximate solutions of nondifferentiable vector optimization problems with cone-convex objectives (Q2311119) (← links)
- Approximate saddle points for constrained vector-valued games. (Q2468641) (← links)
- Approximate duality (Q2483045) (← links)
- A property of efficient and \(\varepsilon\)-efficient solutions in vector optimization (Q2484629) (← links)
- Multiplier rules and saddle-point theorems for Helbig's approximate solutions in convex Pareto problems (Q2494290) (← links)
- Sequential optimality conditions for multiobjective fractional programming problems (Q2512875) (← links)
- A chain rule for \(\varepsilon\)-subdifferentials with applications to approximate solutions in convex Pareto problems (Q2566120) (← links)
- Necessary optimality conditions and saddle points for approximate optimization in Banach space (Q2568603) (← links)
- An ε-lagrange multiplier rule for a mathematical programming problem on banacch spaces<sup>∗</sup> (Q2710387) (← links)
- An implementation of a reduced subgradient method via Luenberger-Mokhtar variant (Q2817227) (← links)
- ε-Optimality Conditions for Vector Optimization Problems with Set-Valued Maps (Q3578000) (← links)
- Epsilon-solutions and epsilon-supports (Q3698651) (← links)
- A method of linearizations for linearly constrained nonconvex nonsmooth minimization (Q3730358) (← links)
- An active set method for solving linearly constrained nonsmooth optimization problems (Q3783077) (← links)
- ε-approximate solutions in multiobjective optimization (Q4227987) (← links)
- <sub>∊</sub>-gradients pour les ponctions localements lipschitziennes et applications (Q4296732) (← links)
- Subgradient projection algorithms for constrained nonsmooth optimization II: nonlinear constraints† (Q4327906) (← links)
- Approximate Saddle Point and Duality for Multiobjective <i>n</i>-Set Optimization (Q4435180) (← links)
