Generalized semi-infinite programming: a tutorial

DOI10.1016/j.cam.2007.02.012zbMath1190.90248OpenAlexW2013786427MaRDI QIDQ929611

Francisco Guerra Vázquez, Oliver Stein, Georg Still, Jan-Joachim Rückmann

Publication date: 17 June 2008

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cam.2007.02.012

zbMATH Keywords

numerical methodsrobust optimizationdesign centeringgeneralized semi-infinite programmingfirst- and second-order optimality conditionsreduction ansatzstructure of the feasible set

Mathematics Subject Classification ID

Nonlinear programming (90C30) Numerical optimization and variational techniques (65K10) Numerical methods based on nonlinear programming (49M37) Semi-infinite programming (90C34)

Related Items

Solving disjunctive optimization problems by generalized semi-infinite optimization techniques, Dynamical Gene-Environment Networks Under Ellipsoidal Uncertainty: Set-Theoretic Regression Analysis Based on Ellipsoidal OR, On the algorithmic solution of optimization problems subject to probabilistic/robust (probust) constraints, Adaptive discretization-based algorithms for semi-infinite programs with unbounded variables, Feasible method for generalized semi-infinite programming, On saddle points in nonconvex semi-infinite programming, Recent advances in nonconvex semi-infinite programming: applications and algorithms, Optimality and duality analysis for multiobjective interval-valued semi-Infinite optimization problem having vanishing constraints, Equilibrium modeling and solution approaches inspired by nonconvex bilevel programming, Generating valid linear inequalities for nonlinear programs via sums of squares, Generalized gradients for probabilistic/robust (probust) constraints, Branch-and-sandwich: a deterministic global optimization algorithm for optimistic bilevel programming problems. I: theoretical development, The semismooth approach for semi-infinite programming under the reduction ansatz, Solving semi-infinite programs by smoothing projected gradient method, Global optimization of generalized semi-infinite programs via restriction of the right hand side, Generalized semi-infinite programming: The symmetric reduction ansatz, Global optimization of generalized semi-infinite programs using disjunctive programming, On linear-quadratic elliptic control problems of semi-infinite type, First order optimality conditions for generalized semi-infinite programming problems, Joint model of probabilistic-robust (probust) constraints applied to gas network optimization, How to solve a semi-infinite optimization problem, On topological properties of min-max functions, Existence of solutions for generalized vector quasi-equilibrium problems in abstract convex spaces with applications, Discretization-based algorithms for generalized semi-infinite and bilevel programs with coupling equality constraints, Necessary and sufficient conditions for optimality of nonsmooth semi-infinite programming, Global solution of semi-infinite programs with existence constraints, Levitin-Polyak well-posedness for generalized semi-infinite multiobjective programming problems, Semi-infinite programming, duality, discretization and optimality conditions†, Lower level duality and the global solution of generalized semi-infinite programs, A solution method for linear variational relation problems, Global optimization of semi-infinite programs via restriction of the right-hand side, Interior point filter method for semi-infinite programming problems, Generalized Levitin-Polyak Well-Posedness for Generalized Semi-Infinite Programs, General semi-infinite programming: critical point theory, Unnamed Item, Unnamed Item, Problem-based optimal scenario generation and reduction in stochastic programming

Cites Work

• Linear optimization and approximation. An introduction to the theoretical analysis and numerical treatment of semi-infinite programs. Transl. from the German
• On constraint qualifications in nonsmooth optimization.
• Second-order and related extremality conditions in nonlinear programming
• Semi-infinite programming
• First order optimality conditions for generalized semi-infinite programming problems
• Perturbation theory of nonlinear programs when the set of optimal solutions is not a singleton
• Differential stability in infinite-dimensional nonlinear programming
• An implementable algorithm for the optimal design centering, tolerancing, and tuning problem
• Computing a global optimal solution to a design centering problem
• A branch-and-bound approach for solving a class of generalized semi-infinite programming problems
• Generalized semi-infinite optimization: A first order optimality condition and examples
• First-order optimality conditions in generalized semi-infinite programming
• Robust solutions of uncertain linear programs
• On the complexity of some basic problems in computational convexity. I. Containment problems
• Optimization. Algorithms and consistent approximations
• Disjunctive optimization: Critical point theory
• Bi-level strategies in semi-infinite programming.
• On optimality conditions for generalized semi-infinite programming problems
• Recent contributions to linear semi-infinite optimization
• Global solution of semi-infinite programs
• Generalized semi-infinite programming: Theory and methods
• Set containment characterization
• Semi-infinite programming and applications. An International Symposium, Austin, Texas, September 8-10, 1981
• On generalized semi-infinite optimization and bilevel optimization
• Stable local minimizers in semi-infinite optimization: Regularity and second-order conditions
• Robust asset allocation
• The Fritz John necessary optimality conditions in the presence of equality and inequality constraints
• Definitheitsbedingungen für relative Extrema bei Optimierungs- und Approximationsaufgaben
• Generalized semi-infinite programming: numerical aspects
• First-Order Optimality Conditions for Degenerate Index Sets in Generalized Semi-Infinite Optimization
• Semi-Infinite Programming: Theory, Methods, and Applications
• Directional differentiability of the optimal value function in a nonlinear programming problem
• A semi-infinite approach to design centering
• On uniqueness of Kuhn-Tucker multipliers in nonlinear programming
• Critical sets in parametric optimization
• On stability and stationary points in nonlinear optimization
• Differential properties of the marginal function in mathematical programming
• Optimization Problems with Perturbations: A Guided Tour
• Semi-infinite terminal problems: a newton type method
• An Extension of the Karush–Kuhn–Tucker Necessity Conditions to Infinite Programming
• One-Parametric Semi-Infinite Optimization: On the Stability of the Feasible Set
• Variational Analysis
• On Generic One-Parametric Semi-Infinite Optimization
• Directional Derivatives for Extremal-Value Functions with Applications to the Completely Convex Case
• Solving Semi-Infinite Optimization Problems with Interior Point Techniques
• On level sets of marginal functions
• Second Order Optimality Conditions Based on Parabolic Second Order Tangent Sets
• Semidefinite Programming
• Second order optimality conditions for generalized semi-infinite programming problems
• On Optimality Conditions in Quasidifferentiable Optimization
• Extensions of the Kuhn--Tucker Constraint Qualification to Generalized Semi-infinite Programming
• Point-to-Set Maps in Mathematical Programming
• Handbook of semidefinite programming. Theory, algorithms, and applications
• Second-order optimality conditions in generalized semi-infinite programming
• On linear and linearized generalized semi-infinite optimization problems
• Semi-infinite programming. Recent advances
• Discretization in semi-infinite programming: the rate of convergence
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item