Pages that link to "Item:Q3608973"

The following pages link to Relaxation-Based Bounds for Semi-Infinite Programs (Q3608973):

Displaying 29 items.

• Branch-and-sandwich: a deterministic global optimization algorithm for optimistic bilevel programming problems. I: theoretical development (Q480823) (← links)
• Global optimization of generalized semi-infinite programs via restriction of the right hand side (Q486720) (← links)
• A feasible point adaptation of the Blankenship and Falk algorithm for semi-infinite programming (Q644521) (← links)
• Min-max and robust polynomial optimization (Q652661) (← links)
• Convergence rate of McCormick relaxations (Q656830) (← 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)
• Global solution of bilevel programs with a nonconvex inner program (Q1016068) (← links)
• A hybrid discretization algorithm with guaranteed feasibility for the global solution of semi-infinite programs (Q1675550) (← links)
• The adaptive convexification algorithm for semi-infinite programming with arbitrary index sets (Q1925776) (← links)
• An algorithm for semi-infinite polynomial optimization (Q1935882) (← 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)
• Global solution of semi-infinite programs with existence constraints (Q2031944) (← links)
• Fault tolerant time optimization for a class of time-varying switched infinite dimensional linear systems (Q2086986) (← 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)
• 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)
• Dynamic optimization of nonlinear systems with guaranteed feasibility of inequality-path-constraints (Q2664250) (← links)
• Lower level duality and the global solution of generalized semi-infinite programs (Q2810114) (← links)
• Global optimization of semi-infinite programs via restriction of the right-hand side (Q3111137) (← 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)
• Recent advances in nonconvex semi-infinite programming: applications and algorithms (Q6114904) (← links)