Global solution of semi-infinite programs
From MaRDI portal
Publication:1780954
DOI10.1007/s10107-005-0583-6zbMath1090.90188OpenAlexW1966607098WikidataQ62732502 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
Approximation methods and heuristics in mathematical programming (90C59) Semi-infinite programming (90C34)
Related Items
A feasible proximal bundle algorithm with convexification for nonsmooth, nonconvex semi-infinite programming, Convergent Algorithms for a Class of Convex Semi-infinite Programs, Constrained incremental bundle method with partial inexact oracle for nonsmooth convex semi-infinite programming problems, A global optimization algorithm for generalized semi-infinite, continuous minimax with coupled constraints and bi-level problems, A review of recent advances in global optimization, Towards global bilevel dynamic optimization, Feasible Method for Semi-Infinite Programs, Method of outer approximations and adaptive approximations for a class of matrix games, Adaptive discretization-based algorithms for semi-infinite programs with unbounded variables, A transformation-based discretization method for solving general semi-infinite optimization problems, Feasible method for generalized semi-infinite programming, 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, A lifting method for generalized semi-infinite programs based on lower level Wolfe duality, Recent advances in nonconvex semi-infinite programming: applications and algorithms, Nonlinear robust optimization via sequential convex bilevel programming, An augmented Lagrangian algorithm for solving semiinfinite programming, A feasible point adaptation of the Blankenship and Falk algorithm for semi-infinite programming, Global solution of nonlinear mixed-integer bilevel programs, An infeasible bundle method for nonconvex constrained optimization with application to semi-infinite programming problems, Branch-and-lift algorithm for deterministic global optimization in nonlinear optimal control, Convergence rate of McCormick relaxations, Generalized semi-infinite programming: a tutorial, Branch-and-sandwich: a deterministic global optimization algorithm for optimistic bilevel programming problems. I: theoretical development, Branch-and-sandwich: a deterministic global optimization algorithm for optimistic bilevel programming problems. Part II: Convergence analysis and numerical results, Solving semi-infinite programs by smoothing projected gradient method, Global optimization of generalized semi-infinite programs via restriction of the right hand side, Global optimization of generalized semi-infinite programs using disjunctive programming, A projection-based reformulation and decomposition algorithm for global optimization of a class of mixed integer bilevel linear programs, A noninterior point homotopy method for semi-infinite programming problems, 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 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, On Solving the Convex Semi-Infinite Minimax Problems via Superlinear 𝒱𝒰 Incremental Bundle Technique with Partial Inexact Oracle
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Global solution of optimization problems with parameter-embedded linear dynamic systems.
- A general class of branch-and-bound methods in global optimization with some new approaches for concave minimization
- Deterministic global optimization with partition sets whose feasibility is not known: Application to concave minimization, reserve convex constraints, DC-programming and Lipschitzian optimization
- Optimal centered forms
- Optimization. Algorithms and consistent approximations
- Bi-level strategies in semi-infinite programming.
- Interval analysis: Theory and applications
- Interval methods for semi-infinite programs
- Generalized semi-infinite programming: Theory and methods
- Semi-Infinite Programming: Theory, Methods, and Applications
- A projected lagrangian algorithm for semi-infinite programming
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
