Pages that link to "Item:Q1680760"
From MaRDI portal
The following pages link to Recent contributions to linear semi-infinite optimization (Q1680760):
Displaying 50 items.
- Constraint qualifications in convex vector semi-infinite optimization (Q320868) (← links)
- A generalized Farkas lemma with a numerical certificate and linear semi-infinite programs with SDP duals (Q501263) (← links)
- Clarke coderivatives of efficient point multifunctions in parametric vector optimization (Q603038) (← links)
- Lipschitzian stability of parametric variational inequalities over generalized polyhedra in Banach spaces (Q608399) (← links)
- The e-support function of an e-convex set and conjugacy for e-convex functions (Q624622) (← links)
- Stability and augmented Lagrangian duality in nonconvex semi-infinite programming (Q644188) (← links)
- On coderivatives and Lipschitzian properties of the dual pair in optimization (Q654087) (← links)
- Complete characterizations of local weak sharp minima with applications to semi-infinite optimization and complementarity (Q654111) (← links)
- Lower semi-continuity of the Pareto solution map in quasiconvex semi-infinite vector optimization (Q662087) (← links)
- Inverse eigenvalue problems for linear complementarity systems (Q716414) (← links)
- An inexact primal-dual algorithm for semi-infinite programming (Q784788) (← links)
- The CoMirror algorithm with random constraint sampling for convex semi-infinite programming (Q828836) (← links)
- Nonsmooth multiple-objective optimization in separable Hilbert spaces (Q838051) (← links)
- Motzkin decomposition of closed convex sets (Q847066) (← links)
- Semi-infinite programming (Q869581) (← links)
- Sensitivity analysis in linear semi-infinite programming: perturbing cost and right-hand-side coefficients (Q877589) (← links)
- Some continuous programming problems in numerical analysis (Q877593) (← links)
- Sufficient conditions for total ill-posedness in linear semi-infinite optimization (Q877594) (← links)
- Characterization of total ill-posedness in linear semi-infinite optimization (Q929606) (← links)
- Portfolios with fuzzy returns: Selection strategies based on semi-infinite programming (Q929609) (← links)
- Generalized semi-infinite programming: a tutorial (Q929611) (← links)
- Stability of the intersection of solution sets of semi-infinite systems (Q929613) (← links)
- On the equivalence of parametric contexts for linear inequality systems (Q929615) (← links)
- Verifying exactness of relaxations for robust semi-definite programs by solving polynomial systems (Q947643) (← links)
- Numerical treatment of Bayesian robustness problems (Q962855) (← links)
- Constraint qualifications for optimality conditions and total Lagrange dualities in convex infinite programming (Q984086) (← links)
- On Motzkin decomposable sets and functions (Q994324) (← links)
- On optimization, dynamics and uncertainty: A tutorial for gene-environment networks (Q1026224) (← links)
- Pseudo-Lipschitz property of linear semi-infinite vector optimization problems (Q1044080) (← links)
- Sufficient conditions for pseudo-Lipschitz property in convex semi-infinite vector optimization problems (Q1044514) (← links)
- A dual characterization of incentive efficiency. (Q1411030) (← links)
- Best approximate solutions of inconsistent linear inequality systems (Q1639954) (← links)
- Recent contributions to linear semi-infinite optimization: an update (Q1730534) (← links)
- Linear semi-infinite programming theory: an updated survey (Q1848390) (← links)
- Stability of the feasible set for linear inequality systems: A carrier index set approach (Q1855408) (← links)
- On linear systems containing strict inequalities (Q1863528) (← links)
- Testing of monotonicity in parametric regression models (Q1866206) (← links)
- Solving a class of fuzzy linear programs by using semi-infinite programming techniques (Q1885701) (← links)
- Quasi \(\epsilon\)-solutions in a semi-infinite programming problem with locally Lipschitz data (Q2037900) (← links)
- 4OR comes of age. Editorial note (Q2040603) (← links)
- On the algorithmic solution of optimization problems subject to probabilistic/robust (probust) constraints (Q2168046) (← links)
- Inverse optimization in semi-infinite linear programs (Q2183204) (← links)
- On solving a class of fractional semi-infinite polynomial programming problems (Q2231044) (← links)
- How to solve a semi-infinite optimization problem (Q2253347) (← links)
- On semi-infinite systems of convex polynomial inequalities and polynomial optimization problems (Q2307704) (← links)
- On \(\epsilon\)-solutions for robust semi-infinite optimization problems (Q2321908) (← links)
- Regularity modulus of arbitrarily perturbed linear inequality systems (Q2427270) (← links)
- Voronoi cells via linear inequality systems (Q2427910) (← links)
- Optimum component test plans for phased-mission systems (Q2456421) (← links)
- Infinite (semi-infinite) problems to characterize the optimality of nonlinear optimization problems (Q2469580) (← links)
