How to solve a semi-infinite optimization problem

DOI10.1016/j.ejor.2012.06.009zbMath1292.90300OpenAlexW2065385799MaRDI QIDQ2253347

Publication date: 27 July 2014

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2012.06.009

zbMATH Keywords

robust optimization genericity semi-infinite optimization design centering adaptive convexification

Mathematics Subject Classification ID

Semi-infinite programming (90C34)

Related Items

A stochastic approximation method for convex programming with many semidefinite constraints, The CoMirror algorithm with random constraint sampling for convex semi-infinite programming, Solving disjunctive optimization problems by generalized semi-infinite optimization techniques, Solving air traffic conflict problems via local continuous optimization, Feasible Method for Semi-Infinite Programs, Conic linear programming duals for classes of quadratic semi-infinite programs with applications, Optimality conditions of approximate solutions for nonsmooth semi-infinite programming problems, How to solve a design centering problem, Recent contributions to linear semi-infinite optimization, Peer group situations and games with fuzzy uncertainty, Optimization with Multivariate Stochastic Dominance Constraints, A modified exchange algorithm for distributional robust optimization and applications in risk management, Adaptive Bundle Methods for Nonlinear Robust Optimization, A lifting method for generalized semi-infinite programs based on lower level Wolfe duality, Recent advances in nonconvex semi-infinite programming: applications and algorithms, Equilibrium modeling and solution approaches inspired by nonconvex bilevel programming, Generating valid linear inequalities for nonlinear programs via sums of squares, Approximate optimality conditions and mixed type duality for semi-infinite multiobjective programming problems involving tangential subdifferentials, Model Order Reduction Techniques with a Posteriori Error Control for Nonlinear Robust Optimization Governed by Partial Differential Equations, Structure-Preserving Function Approximation via Convex Optimization, Unnamed Item, Recent contributions to linear semi-infinite optimization: an update, Solving semi-infinite programs by smoothing projected gradient method, Global optimization of generalized semi-infinite programs via restriction of the right hand side, Detecting and solving aircraft conflicts using bilevel programming, Convex SIP problems with finitely representable compact index sets: immobile indices and the properties of the auxiliary NLP problem, Global optimization of generalized semi-infinite programs using disjunctive programming, Optimality conditions for nonlinear infinite programming problems, Multiobjective optimization under uncertainty: a multiobjective robust (relative) regret approach, On smoothness properties of optimal value functions at the boundary of their domain under complete convexity, Optimization approaches to supervised classification, Discretization-based algorithms for generalized semi-infinite and bilevel programs with coupling equality constraints, A standard branch-and-bound approach for nonlinear semi-infinite problems, Global solution of semi-infinite programs with existence constraints, Levitin-Polyak well-posedness for generalized semi-infinite multiobjective programming problems, Backward-forward reachable set splitting for state-constrained differential games, Lower level duality and the global solution of generalized semi-infinite programs, Lagrange duality and saddle point optimality conditions for semi-infinite mathematical programming problems with equilibrium constraints, A general framework for robust topology optimization under load-uncertainty including stress constraints, Unnamed Item, Tractable model discrimination for safety-critical systems with disjunctive and coupled constraints, Interactions Between Bilevel Optimization and Nash Games, Approximate optimality for quasi approximate solutions in nonsmooth semi-infinite programming problems, using ε-upper semi-regular semi-convexificators, A projection approach to monotonic regression with Bernstein polynomials, Robust nonlinear optimization with conic representable uncertainty set

Cites Work