The Adaptive Convexification Algorithm: A Feasible Point Method for Semi-Infinite Programming
From MaRDI portal
Recommendations
- The adaptive convexification algorithm for semi-infinite programming with arbitrary index sets
- Feasible method for semi-infinite programs
- An adaptive discretization method solving semi-infinite optimization problems with quadratic rate of convergence
- Feasible method for generalized semi-infinite programming
- A feasible proximal bundle algorithm with convexification for nonsmooth, nonconvex semi-infinite programming
Cited in
(63)- Global solution of bilevel programs with a nonconvex inner program
- On bilevel programs with a convex lower-level problem violating Slater's constraint qualification
- A hybrid discretization algorithm with guaranteed feasibility for the global solution of semi-infinite programs
- A proximal bundle method for constrained nonsmooth nonconvex optimization with inexact information
- An infeasible bundle method for nonconvex constrained optimization with application to semi-infinite programming problems
- Stochastic algorithm for solving convex semi-infinite programming problems with equality and inequality constraints
- The adaptive convexification algorithm for semi-infinite programming with arbitrary index sets
- A generalization of the classical BB convex underestimation via diagonal and nondiagonal quadratic terms
- A lifting method for generalized semi-infinite programs based on lower level Wolfe duality
- Global solution of nonlinear mixed-integer bilevel programs
- Convexification method for bilevel programs with a nonconvex Follower's problem
- Global solution of semi-infinite programs with existence constraints
- A feasible proximal bundle algorithm with convexification for nonsmooth, nonconvex semi-infinite programming
- Adaptive discretization-based algorithms for semi-infinite programs with unbounded variables
- On solving a class of fractional semi-infinite polynomial programming problems
- 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
- Guaranteed satisfaction of inequality state constraints in PDE-constrained optimization
- Nonlinear robust optimization via sequential convex bilevel programming
- A transformation-based discretization method for solving general semi-infinite optimization problems
- Dynamic optimization of nonlinear systems with guaranteed feasibility of inequality-path-constraints
- Dynamic optimization of state-dependent switched systems with free switching sequences
- Lower level duality and the global solution of generalized semi-infinite programs
- On the treatment of distributed uncertainties in PDE-constrained optimization
- Global optimization of semi-infinite programs via restriction of the right-hand side
- A novel feasible discretization method for linear semi-infinite programming applied to basket option pricing
- Towards rigorous robust optimal control via generalized high-order moment expansion
- Feasible method for semi-infinite programs
- A globally convergent algorithm with adaptively refined discretization for semi-infinite optimization problems arising in engineering design
- scientific article; zbMATH DE number 5177259 (Why is no real title available?)
- Solving Semi-Infinite Optimization Problems with Interior Point Techniques
- Branch-and-sandwich: a deterministic global optimization algorithm for optimistic bilevel programming problems. I: theoretical development
- Solving semi-infinite programs by smoothing projected gradient method
- Global optimization of generalized semi-infinite programs via restriction of the right hand side
- MPEC methods for bilevel optimization problems
- EAGO.jl: easy advanced global optimization in Julia
- Convergent Algorithms for a Class of Convex Semi-infinite Programs
- An adaptive discretization method solving semi-infinite optimization problems with quadratic rate of convergence
- Sparse inverse problems over measures: equivalence of the conditional gradient and exchange methods
- scientific article; zbMATH DE number 227711 (Why is no real title available?)
- Efficient shape optimization for certain and uncertain aerodynamic design
- Primal-dual path following method for nonlinear semi-infinite programs with semi-definite constraints
- Feasible method for generalized semi-infinite programming
- Recent advances in nonconvex semi-infinite programming: applications and algorithms
- A feasible point adaptation of the Blankenship and Falk algorithm for semi-infinite programming
- Multi-objective dynamic optimization of path-constrained switched systems
- Global optimization of generalized semi-infinite programs using disjunctive programming
- A projection-based reformulation and decomposition algorithm for global optimization of a class of mixed integer bilevel linear programs
- Bounding-focused discretization methods for the global optimization of nonconvex semi-infinite programs
- Polynomial optimization relaxations for generalized semi-infinite programs
- Discretization algorithms for generalized semi-infinite programs with coupling equality constraints under local solution stability
- Relaxed cutting plane method with convexification for solving nonlinear semi-infinite programming problems
- Convex semi-infinite programming algorithms with inexact separation oracles
- A novel method for path-constrained dynamic optimization via integral transcription and inner approximation
- Derivative-enhanced lower-Bounding in adaptive discretization for the global solution of semi-infinite optimization problems
- A provable semi-infinite programming approach for solving constrained dynamic games
- Local reduction based SQP-type method for semi-infinite programs with an infinite number of second-order cone constraints
- A review of recent advances in global optimization
- Towards global bilevel dynamic optimization
- Local optimization of dynamic programs with guaranteed satisfaction of path constraints
- The semismooth approach for semi-infinite programming under the reduction ansatz
- Smoothing by mollifiers. I: Semi-infinite optimization
This page was built for publication: The Adaptive Convexification Algorithm: A Feasible Point Method for Semi-Infinite Programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3544257)
