Recent advances in nonconvex semi-infinite programming: applications and algorithms
From MaRDI portal
Publication:6114904
DOI10.1016/j.ejco.2021.100006zbMath1530.90106OpenAlexW3195475456MaRDI QIDQ6114904
No author found.
Publication date: 12 July 2023
Published in: EURO Journal on Computational Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejco.2021.100006
Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Semi-infinite programming (90C34) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Solving disjunctive optimization problems by generalized semi-infinite optimization techniques
- Branch-and-sandwich: a deterministic global optimization algorithm for optimistic bilevel programming problems. I: theoretical development
- Branch-and-sandwich: a deterministic global optimization algorithm for optimistic bilevel programming problems. Part II: Convergence analysis and numerical results
- Global optimization of generalized semi-infinite programs via restriction of the right hand side
- A feasible point adaptation of the Blankenship and Falk algorithm for semi-infinite programming
- Global optimization of generalized semi-infinite programs using disjunctive programming
- A global optimization algorithm for generalized semi-infinite, continuous minimax with coupled constraints and bi-level problems
- Semi-infinite programming
- Local optimization of dynamic programs with guaranteed satisfaction of path constraints
- Generalized semi-infinite programming: a tutorial
- Application of general semi-infinite programming to lapidary cutting problems
- Global solution of bilevel programs with a nonconvex inner program
- An implementable algorithm for the optimal design centering, tolerancing, and tuning problem
- Computing a global optimal solution to a design centering problem
- Infinitely constrained optimization problems
- Robust solutions of uncertain linear programs
- On the complexity of some basic problems in computational convexity. I. Containment problems
- Family of projected descent methods for optimization problems with simple bounds
- Bi-level strategies in semi-infinite programming.
- Adjustable robust solutions of uncertain linear programs
- A hybrid discretization algorithm with guaranteed feasibility for the global solution of semi-infinite programs
- An infeasible bundle method for nonconvex constrained optimization with application to semi-infinite programming problems
- Recent contributions to linear semi-infinite optimization: an update
- A noninterior point homotopy method for semi-infinite programming problems
- Interval methods for semi-infinite programs
- Global solution of semi-infinite programs
- Generalized semi-infinite programming: Theory and methods
- Set containment characterization
- On generalized semi-infinite optimization and bilevel optimization
- The adaptive convexification algorithm for semi-infinite programming with arbitrary index sets
- Global solution of nonlinear mixed-integer bilevel programs
- An interior point sequential quadratic programming-type method for log-determinant semi-infinite programs
- Global solution of semi-infinite programs with existence constraints
- A note on solving discretely-constrained Nash-Cournot games via complementarity
- How to solve a semi-infinite optimization problem
- 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
- A homotopy interior point method for semi-infinite programming problems
- Adjustable robust optimization models for a nonlinear two-period system
- Generalized semi-infinite programming: numerical aspects
- A New Exchange Method for Convex Semi-Infinite Programming
- Global optimization of semi-infinite programs via restriction of the right-hand side
- Semi-Infinite Programming: Theory, Methods, and Applications
- A hybrid algorithm for infinitely constrained optimization
- Obtaining accurate solutions using reduced chemical kinetic models: a new model reduction method for models rigorously validated over ranges
- A semi-infinite approach to design centering
- The Adaptive Convexification Algorithm: A Feasible Point Method for Semi-Infinite Programming
- Relaxation-Based Bounds for Semi-Infinite Programs
- Semi-infinite programming, duality, discretization and optimality conditions†
- Cutting-set methods for robust convex optimization with pessimizing oracles
- A nonconvex max-min problem
- Introduction to Stochastic Programming
- Solving Semi-Infinite Optimization Problems with Interior Point Techniques
- Bilevel Optimization: Reformulation and First Optimality Conditions
- Interactions Between Bilevel Optimization and Nash Games
- Pessimistic Bilevel Optimization
- Robust capacity expansion of network flows
This page was built for publication: Recent advances in nonconvex semi-infinite programming: applications and algorithms