Pages that link to "Item:Q1780954"

The following pages link to Global solution of semi-infinite programs (Q1780954):

Displaying 41 items.

• Constrained incremental bundle method with partial inexact oracle for nonsmooth convex semi-infinite programming problems (Q288406) (← links)
• Method of outer approximations and adaptive approximations for a class of matrix games (Q328448) (← links)
• Branch-and-lift algorithm for deterministic global optimization in nonlinear optimal control (Q467420) (← links)
• Branch-and-sandwich: a deterministic global optimization algorithm for optimistic bilevel programming problems. I: theoretical development (Q480823) (← links)
• Branch-and-sandwich: a deterministic global optimization algorithm for optimistic bilevel programming problems. Part II: Convergence analysis and numerical results (Q480824) (← 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)
• 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)
• Convergence rate of McCormick relaxations (Q656830) (← 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)
• A global optimization algorithm for generalized semi-infinite, continuous minimax with coupled constraints and bi-level problems (Q839044) (← links)
• A review of recent advances in global optimization (Q842710) (← links)
• Towards global bilevel dynamic optimization (Q842715) (← links)
• Generalized semi-infinite programming: a tutorial (Q929611) (← 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)
• An infeasible bundle method for nonconvex constrained optimization with application to semi-infinite programming problems (Q1717575) (← links)
• A noninterior point homotopy method for semi-infinite programming problems (Q1743361) (← links)
• The adaptive convexification algorithm for semi-infinite programming with arbitrary index sets (Q1925776) (← links)
• A lifting method for generalized semi-infinite programs based on lower level Wolfe duality (Q1938906) (← links)
• An augmented Lagrangian algorithm for solving semiinfinite programming (Q1952762) (← links)
• Global solution of nonlinear mixed-integer bilevel programs (Q1959230) (← 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)
• 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)
• How to solve a design centering problem (Q2408900) (← 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)
• 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)
• Obtaining accurate solutions using reduced chemical kinetic models: a new model reduction method for models rigorously validated over ranges (Q3424282) (← links)
• Feasible Method for Semi-Infinite Programs (Q3461986) (← links)
• On Solving the Convex Semi-Infinite Minimax Problems via Superlinear 𝒱𝒰 Incremental Bundle Technique with Partial Inexact Oracle (Q5024906) (← links)
• Convergent Algorithms for a Class of Convex Semi-infinite Programs (Q5043283) (← links)
• Recent advances in nonconvex semi-infinite programming: applications and algorithms (Q6114904) (← links)