Interval methods for semi-infinite programs
From MaRDI portal
Publication:1773106
DOI10.1007/s10589-005-4556-8zbMath1130.90048OpenAlexW2086828451WikidataQ62732505 ScholiaQ62732505MaRDI QIDQ1773106
William H. Green, Binita Bhattacharjee, Paul I. Barton
Publication date: 25 April 2005
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-005-4556-8
Numerical mathematical programming methods (65K05) Semi-infinite programming (90C34) General methods in interval analysis (65G40)
Related Items (27)
A feasible proximal bundle algorithm with convexification for nonsmooth, nonconvex semi-infinite programming ⋮ A review of recent advances in global optimization ⋮ Towards global bilevel dynamic optimization ⋮ Feasible Method for Semi-Infinite Programs ⋮ Adaptive discretization-based algorithms for semi-infinite programs with unbounded variables ⋮ Dynamic optimization of nonlinear systems with guaranteed feasibility of inequality-path-constraints ⋮ How to solve a design centering problem ⋮ A hybrid discretization algorithm with guaranteed feasibility for the global solution of semi-infinite programs ⋮ The adaptive convexification algorithm for semi-infinite programming with arbitrary index sets ⋮ An algorithm for semi-infinite polynomial optimization ⋮ A lifting method for generalized semi-infinite programs based on lower level Wolfe duality ⋮ Recent advances in nonconvex semi-infinite programming: applications and algorithms ⋮ Semidefinite relaxations for semi-infinite polynomial programming ⋮ Convergence rate of McCormick relaxations ⋮ Branch-and-sandwich: a deterministic global optimization algorithm for optimistic bilevel programming problems. I: theoretical development ⋮ Global optimization of generalized semi-infinite programs via restriction of the right hand side ⋮ Global optimization of generalized semi-infinite programs using disjunctive programming ⋮ How to solve a semi-infinite optimization problem ⋮ Relaxed cutting plane method with convexification for solving nonlinear semi-infinite programming problems ⋮ Discretization-based algorithms for generalized semi-infinite and bilevel programs with coupling equality constraints ⋮ Global solution of semi-infinite programs ⋮ A standard branch-and-bound approach for nonlinear semi-infinite problems ⋮ Global solution of semi-infinite programs with existence constraints ⋮ Lower level duality and the global solution of generalized semi-infinite programs ⋮ Global solution of bilevel programs with a nonconvex inner program ⋮ Global optimization of semi-infinite programs via restriction of the right-hand side ⋮ Obtaining accurate solutions using reduced chemical kinetic models: a new model reduction method for models rigorously validated over ranges
Uses Software
This page was built for publication: Interval methods for semi-infinite programs
