The following pages link to (Q4357206):
Displaying 50 items.
- Slater CQ, optimality and duality for quasiconvex semi-infinite optimization problems (Q890525) (← links)
- Characterizing robust local error bounds for linear inequality systems under data uncertainty (Q891541) (← links)
- Extensions of Gauss quadrature via linear programming (Q896553) (← links)
- Stability in linear optimization under perturbations of the left-hand side coefficients (Q904313) (← links)
- Robust global error bounds for uncertain linear inequality systems with applications (Q905714) (← links)
- Complete characterizations of stable Farkas' lemma and cone-convex programming duality (Q927159) (← links)
- Lipschitz behavior of convex semi-infinite optimization problems: a variational approach (Q933792) (← links)
- The semismooth approach for semi-infinite programming under the reduction ansatz (Q933800) (← links)
- Smoothing by mollifiers. I: Semi-infinite optimization (Q934789) (← links)
- First order optimality conditions for generalized semi-infinite programming problems (Q946193) (← links)
- Global weak sharp minima for convex (semi-)infinite optimization problems (Q950495) (← links)
- The design of optimum component test plans for system reliability (Q959396) (← links)
- Primal-dual stability in continuous linear optimization (Q959934) (← links)
- Augmented lagrangians in semi-infinite programming (Q959953) (← links)
- Cyclic convex bodies and optimization moment problems (Q996313) (← links)
- Stability of the feasible set mapping of linear systems with an exact constraint set (Q1005130) (← links)
- On the Lipschitz modulus of the argmin mapping in linear semi-infinite optimization (Q1005132) (← links)
- Stability of indices in the KKT conditions and metric regularity in convex semi-infinite optimization (Q1014043) (← links)
- \(\varepsilon \)-optimality and \(\varepsilon \)-Lagrangian duality for a nonconvex programming problem with an infinite number of constraints (Q1028592) (← links)
- Global parametric sufficient optimality conditions for semi-infinite discrete minmax fractional programming problems involving generalized \((\eta ,\rho )\)-invex functions (Q1036869) (← links)
- The Lagrange approach to infinite linear programs (Q1348714) (← links)
- Subcalculus for set functions and cores of TU games. (Q1394991) (← links)
- Saturation in linear optimization (Q1411507) (← links)
- Representability of convex sets by analytical linear inequality systems. (Q1428616) (← links)
- Directional end of a convex set: theory and applications. (Q1608146) (← links)
- Normal regularity for the feasible set of semi-infinite multiobjective optimization problems with applications (Q1615937) (← links)
- Stable and total Fenchel duality for composed convex optimization problems (Q1617041) (← links)
- Best approximate solutions of inconsistent linear inequality systems (Q1639954) (← links)
- Optimality conditions of approximate solutions for nonsmooth semi-infinite programming problems (Q1660296) (← links)
- On the sufficiency of finite support duals in semi-infinite linear programming (Q1667165) (← links)
- A unifying approach to robust convex infinite optimization duality (Q1673912) (← links)
- Stability of the duality gap in linear optimization (Q1679595) (← links)
- Recent contributions to linear semi-infinite optimization (Q1680760) (← links)
- Optimality conditions for convex semi-infinite programming problems with finitely representable compact index sets (Q1682971) (← links)
- A comparative note on the relaxation algorithms for the linear semi-infinite feasibility problem (Q1686516) (← links)
- Necessary conditions for nonsmooth multiobjective semi-infinite problems using Michel-penot subdifferential (Q1693844) (← links)
- A proximal bundle method for constrained nonsmooth nonconvex optimization with inexact information (Q1704913) (← links)
- An infeasible bundle method for nonconvex constrained optimization with application to semi-infinite programming problems (Q1717575) (← links)
- Robust alternative theorem for linear inequalities with applications to robust multiobjective optimization (Q1728358) (← links)
- On optimality conditions and duality theorems for robust semi-infinite multiobjective optimization problems (Q1730467) (← links)
- Optimality conditions and duality for semi-infinite mathematical programming problems with equilibrium constraints, using convexificators (Q1730476) (← links)
- Recent contributions to linear semi-infinite optimization: an update (Q1730534) (← links)
- Robustness in deterministic vector optimization (Q1730805) (← links)
- Convergent hierarchy of SDP relaxations for a class of semi-infinite convex polynomial programs and applications (Q1740163) (← links)
- An accelerated central cutting plane algorithm for linear semi-infinite programming (Q1764241) (← links)
- Distance to ill-posedness and the consistency value of linear semi-infinite inequality systems (Q1777217) (← links)
- Duality theorems and algorithms for linear programming in measure spaces (Q1777445) (← links)
- An approximation approach to non-strictly convex quadratic semi-infinite programming (Q1777448) (← links)
- On the continuity of the optimal value in parametric linear optimization: Stable discretization of the Lagrangian dual of nonlinear problems (Q1781003) (← links)
- Aggregation-based cutting-planes for packing and covering integer programs (Q1785202) (← links)
