Pages that link to "Item:Q3544257"
From MaRDI portal
The following pages link to The Adaptive Convexification Algorithm: A Feasible Point Method for Semi-Infinite Programming (Q3544257):
Displaying 49 items.
- Branch-and-sandwich: a deterministic global optimization algorithm for optimistic bilevel programming problems. I: theoretical development (Q480823) (← links)
- Solving semi-infinite programs by smoothing projected gradient method (Q480937) (← links)
- Global optimization of generalized semi-infinite programs via restriction of the right hand side (Q486720) (← links)
- Efficient shape optimization for certain and uncertain aerodynamic design (Q536665) (← links)
- Feasible method for generalized semi-infinite programming (Q604267) (← links)
- A feasible point adaptation of the Blankenship and Falk algorithm for semi-infinite programming (Q644521) (← links)
- Global optimization of generalized semi-infinite programs using disjunctive programming (Q670652) (← links)
- A projection-based reformulation and decomposition algorithm for global optimization of a class of mixed integer bilevel linear programs (Q670656) (← links)
- Relaxed cutting plane method with convexification for solving nonlinear semi-infinite programming problems (Q694542) (← links)
- Local reduction based SQP-type method for semi-infinite programs with an infinite number of second-order cone constraints (Q740634) (← links)
- A review of recent advances in global optimization (Q842710) (← links)
- Towards global bilevel dynamic optimization (Q842715) (← links)
- Local optimization of dynamic programs with guaranteed satisfaction of path constraints (Q901119) (← links)
- The semismooth approach for semi-infinite programming under the reduction ansatz (Q933800) (← links)
- Smoothing by mollifiers. I: Semi-infinite optimization (Q934789) (← links)
- Global solution of bilevel programs with a nonconvex inner program (Q1016068) (← links)
- On bilevel programs with a convex lower-level problem violating Slater's constraint qualification (Q1626528) (← links)
- A hybrid discretization algorithm with guaranteed feasibility for the global solution of semi-infinite programs (Q1675550) (← links)
- A proximal bundle method for constrained nonsmooth nonconvex optimization with inexact information (Q1704913) (← links)
- An infeasible bundle method for nonconvex constrained optimization with application to semi-infinite programming problems (Q1717575) (← links)
- The adaptive convexification algorithm for semi-infinite programming with arbitrary index sets (Q1925776) (← links)
- A generalization of the classical \(\alpha \)BB convex underestimation via diagonal and nondiagonal quadratic terms (Q1937084) (← links)
- A lifting method for generalized semi-infinite programs based on lower level Wolfe duality (Q1938906) (← links)
- Global solution of nonlinear mixed-integer bilevel programs (Q1959230) (← links)
- Convexification method for bilevel programs with a nonconvex Follower's problem (Q2031936) (← links)
- Global solution of semi-infinite programs with existence constraints (Q2031944) (← links)
- A feasible proximal bundle algorithm with convexification for nonsmooth, nonconvex semi-infinite programming (Q2129642) (← links)
- Adaptive discretization-based algorithms for semi-infinite programs with unbounded variables (Q2168050) (← links)
- On solving a class of fractional semi-infinite polynomial programming problems (Q2231044) (← links)
- How to solve a semi-infinite optimization problem (Q2253347) (← links)
- Discretization-based algorithms for generalized semi-infinite and bilevel programs with coupling equality constraints (Q2274885) (← links)
- A standard branch-and-bound approach for nonlinear semi-infinite problems (Q2282532) (← links)
- Guaranteed satisfaction of inequality state constraints in PDE-constrained optimization (Q2288641) (← links)
- Nonlinear robust optimization via sequential convex bilevel programming (Q2434994) (← links)
- A transformation-based discretization method for solving general semi-infinite optimization problems (Q2661756) (← links)
- Dynamic optimization of nonlinear systems with guaranteed feasibility of inequality-path-constraints (Q2664250) (← links)
- Dynamic optimization of state-dependent switched systems with free switching sequences (Q2682298) (← links)
- Lower level duality and the global solution of generalized semi-infinite programs (Q2810114) (← links)
- On the treatment of distributed uncertainties in PDE-constrained optimization (Q3058181) (← links)
- Global optimization of semi-infinite programs via restriction of the right-hand side (Q3111137) (← links)
- A novel feasible discretization method for linear semi-infinite programming applied to basket option pricing (Q3111142) (← links)
- Towards rigorous robust optimal control via generalized high-order moment expansion (Q3176438) (← links)
- Feasible Method for Semi-Infinite Programs (Q3461986) (← links)
- MPEC Methods for Bilevel Optimization Problems (Q5014634) (← links)
- EAGO.jl: easy advanced global optimization in Julia (Q5038425) (← links)
- Convergent Algorithms for a Class of Convex Semi-infinite Programs (Q5043283) (← links)
- Sparse Inverse Problems over Measures: Equivalence of the Conditional Gradient and Exchange Methods (Q5231667) (← links)
- Primal-dual path following method for nonlinear semi-infinite programs with semi-definite constraints (Q6038645) (← links)
- Recent advances in nonconvex semi-infinite programming: applications and algorithms (Q6114904) (← links)