Global solution of semi-infinite programs

From MaRDI portal
Revision as of 08:00, 1 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:1780954

DOI10.1007/S10107-005-0583-6zbMath1090.90188DBLPjournals/mp/BhattacharjeeLGB05OpenAlexW1966607098WikidataQ62732502 ScholiaQ62732502MaRDI QIDQ1780954

Panayiotis Lemonidis, William H. Green, Paul I. Barton, Binita Bhattacharjee

Publication date: 14 June 2005

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-005-0583-6




Related Items (41)

A feasible proximal bundle algorithm with convexification for nonsmooth, nonconvex semi-infinite programmingConvergent Algorithms for a Class of Convex Semi-infinite ProgramsConstrained incremental bundle method with partial inexact oracle for nonsmooth convex semi-infinite programming problemsA global optimization algorithm for generalized semi-infinite, continuous minimax with coupled constraints and bi-level problemsA review of recent advances in global optimizationTowards global bilevel dynamic optimizationFeasible Method for Semi-Infinite ProgramsMethod of outer approximations and adaptive approximations for a class of matrix gamesAdaptive discretization-based algorithms for semi-infinite programs with unbounded variablesA transformation-based discretization method for solving general semi-infinite optimization problemsFeasible method for generalized semi-infinite programmingDynamic optimization of nonlinear systems with guaranteed feasibility of inequality-path-constraintsHow to solve a design centering problemA hybrid discretization algorithm with guaranteed feasibility for the global solution of semi-infinite programsThe adaptive convexification algorithm for semi-infinite programming with arbitrary index setsA lifting method for generalized semi-infinite programs based on lower level Wolfe dualityRecent advances in nonconvex semi-infinite programming: applications and algorithmsNonlinear robust optimization via sequential convex bilevel programmingAn augmented Lagrangian algorithm for solving semiinfinite programmingA feasible point adaptation of the Blankenship and Falk algorithm for semi-infinite programmingGlobal solution of nonlinear mixed-integer bilevel programsAn infeasible bundle method for nonconvex constrained optimization with application to semi-infinite programming problemsBranch-and-lift algorithm for deterministic global optimization in nonlinear optimal controlConvergence rate of McCormick relaxationsGeneralized semi-infinite programming: a tutorialBranch-and-sandwich: a deterministic global optimization algorithm for optimistic bilevel programming problems. I: theoretical developmentBranch-and-sandwich: a deterministic global optimization algorithm for optimistic bilevel programming problems. Part II: Convergence analysis and numerical resultsSolving semi-infinite programs by smoothing projected gradient methodGlobal optimization of generalized semi-infinite programs via restriction of the right hand sideGlobal optimization of generalized semi-infinite programs using disjunctive programmingA projection-based reformulation and decomposition algorithm for global optimization of a class of mixed integer bilevel linear programsA noninterior point homotopy method for semi-infinite programming problemsHow to solve a semi-infinite optimization problemRelaxed cutting plane method with convexification for solving nonlinear semi-infinite programming problemsDiscretization-based algorithms for generalized semi-infinite and bilevel programs with coupling equality constraintsGlobal solution of semi-infinite programs with existence constraintsLower level duality and the global solution of generalized semi-infinite programsGlobal solution of bilevel programs with a nonconvex inner programGlobal optimization of semi-infinite programs via restriction of the right-hand sideObtaining accurate solutions using reduced chemical kinetic models: a new model reduction method for models rigorously validated over rangesOn Solving the Convex Semi-Infinite Minimax Problems via Superlinear 𝒱𝒰 Incremental Bundle Technique with Partial Inexact Oracle


Uses Software



Cites Work




This page was built for publication: Global solution of semi-infinite programs