Pages that link to "Item:Q3111137"

The following pages link to Global optimization of semi-infinite programs via restriction of the right-hand side (Q3111137):

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)
• Global optimization of generalized semi-infinite programs using disjunctive programming (Q670652) (← links)
• Local optimization of dynamic programs with guaranteed satisfaction of path constraints (Q901119) (← links)
• Optimal deterministic algorithm generation (Q1668803) (← links)
• A hybrid discretization algorithm with guaranteed feasibility for the global solution of semi-infinite programs (Q1675550) (← links)
• Convergent upper bounds in global minimization with nonlinear equality constraints (Q2020617) (← links)
• Global solution of semi-infinite programs with existence constraints (Q2031944) (← links)
• On sample average approximation for two-stage stochastic programs without relatively complete recourse (Q2097656) (← 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)
• Guaranteed satisfaction of inequality state constraints in PDE-constrained optimization (Q2288641) (← links)
• Integration of expert knowledge into radial basis function surrogate models (Q2358065) (← links)
• A branch and bound algorithm for quantified quadratic programming (Q2397427) (← links)
• How to solve a design centering problem (Q2408900) (← 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)
• Towards rigorous robust optimal control via generalized high-order moment expansion (Q3176438) (← links)
• Feasible Method for Semi-Infinite Programs (Q3461986) (← links)
• EAGO.jl: easy advanced global optimization in Julia (Q5038425) (← links)
• Convergent Algorithms for a Class of Convex Semi-infinite Programs (Q5043283) (← links)
• An adaptive discretization method solving semi-infinite optimization problems with quadratic rate of convergence (Q5093681) (← links)
• Recent advances in nonconvex semi-infinite programming: applications and algorithms (Q6114904) (← links)
• Equilibrium modeling and solution approaches inspired by nonconvex bilevel programming (Q6155058) (← links)
• On the convergence of local solutions for the method quADAPT (Q6618212) (← links)