Global solution of semi-infinite programs
From MaRDI portal
Recommendations
- Global optimization of semi-infinite programs via restriction of the right-hand side
- Relaxation-Based Bounds for Semi-Infinite Programs
- Interval methods for semi-infinite programs
- Global solution of semi-infinite programs with existence constraints
- Semi-infinite programming and applications to minimax problems
Cites work
- scientific article; zbMATH DE number 3649911 (Why is no real title available?)
- scientific article; zbMATH DE number 3936378 (Why is no real title available?)
- scientific article; zbMATH DE number 914364 (Why is no real title available?)
- A general class of branch-and-bound methods in global optimization with some new approaches for concave minimization
- A projected lagrangian algorithm for semi-infinite programming
- Bi-level strategies in semi-infinite programming.
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Deterministic global optimization with partition sets whose feasibility is not known: Application to concave minimization, reserve convex constraints, DC-programming and Lipschitzian optimization
- Generalized semi-infinite programming: Theory and methods
- Global solution of optimization problems with parameter-embedded linear dynamic systems.
- Interval analysis: Theory and applications
- Interval methods for semi-infinite programs
- Optimal centered forms
- Optimization. Algorithms and consistent approximations
- Semi-Infinite Programming: Theory, Methods, and Applications
Cited in
(53)- Branch-and-sandwich: a deterministic global optimization algorithm for optimistic bilevel programming problems. Part II: Convergence analysis and numerical results
- Recent advances in nonconvex semi-infinite programming: applications and algorithms
- Dynamic optimization of nonlinear systems with guaranteed feasibility of inequality-path-constraints
- A global optimization algorithm for generalized semi-infinite, continuous minimax with coupled constraints and bi-level problems
- A feasible proximal bundle algorithm with convexification for nonsmooth, nonconvex semi-infinite programming
- Global optimization of semi-infinite programs via restriction of the right-hand side
- Application of general semi-infinite programming to lapidary cutting problems
- A noninterior point homotopy method for semi-infinite programming problems
- Global solution of bilevel programs with a nonconvex inner program
- A combined descent gradient method and discretization method for convex SIP
- Constrained incremental bundle method with partial inexact oracle for nonsmooth convex semi-infinite programming problems
- A review of recent advances in global optimization
- Relaxation-Based Bounds for Semi-Infinite Programs
- Solving semi-infinite programs by smoothing projected gradient method
- Semi-infinite programming and applications to minimax problems
- Obtaining accurate solutions using reduced chemical kinetic models: a new model reduction method for models rigorously validated over ranges
- Generalized semi-infinite programming: numerical aspects
- A transformation-based discretization method for solving general semi-infinite optimization problems
- Global solution of semi-infinite programs with existence constraints
- Discretization-based algorithms for generalized semi-infinite and bilevel programs with coupling equality constraints
- Global solution of nonlinear mixed-integer bilevel programs
- Feasible method for generalized semi-infinite programming
- Method of outer approximations and adaptive approximations for a class of matrix games
- Generalized semi-infinite programming: a tutorial
- A standard branch-and-bound approach for nonlinear semi-infinite problems
- Branch-and-sandwich: a deterministic global optimization algorithm for optimistic bilevel programming problems. I: theoretical development
- Branch-and-lift algorithm for deterministic global optimization in nonlinear optimal control
- SIPAMPL
- Convergence rate of McCormick relaxations
- Adaptive discretization-based algorithms for semi-infinite programs with unbounded variables
- Towards global bilevel dynamic optimization
- A hybrid discretization algorithm with guaranteed feasibility for the global solution of semi-infinite programs
- An explicit exchange algorithm for linear semi-infinite programming problems with second-order cone constraints
- Global optimization of generalized semi-infinite programs via restriction of the right hand side
- A regularized explicit exchange method for semi-infinite programs with an infinite number of conic constraints
- Nonlinear robust optimization via sequential convex bilevel programming
- A feasible point adaptation of the Blankenship and Falk algorithm for semi-infinite programming
- Relaxed cutting plane method with convexification for solving nonlinear semi-infinite programming problems
- A lifting method for generalized semi-infinite programs based on lower level Wolfe duality
- Convergent Algorithms for a Class of Convex Semi-infinite Programs
- An augmented Lagrangian algorithm for solving semiinfinite programming
- Feasible method for semi-infinite programs
- How to solve a semi-infinite optimization problem
- How to solve a design centering problem
- Mixed integer semi-infinite programming problem
- Interval methods for semi-infinite programs
- Lower level duality and the global solution of generalized semi-infinite programs
- A projection-based reformulation and decomposition algorithm for global optimization of a class of mixed integer bilevel linear programs
- Global optimization of generalized semi-infinite programs using disjunctive programming
- Near-optimal solutions of convex semi-infinite programs via targeted sampling
- On solving the convex semi-infinite minimax problems via superlinear \(\mathcal{VU}\) incremental bundle technique with partial inexact oracle
- The adaptive convexification algorithm for semi-infinite programming with arbitrary index sets
- An infeasible bundle method for nonconvex constrained optimization with application to semi-infinite programming problems
This page was built for publication: Global solution of semi-infinite programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1780954)
