Solving Semi-Infinite Optimization Problems with Interior Point Techniques
From MaRDI portal
Recommendations
- An interior-point method for semi-infinite programming problems
- The Adaptive Convexification Algorithm: A Feasible Point Method for Semi-Infinite Programming
- An interior semi-infinite programming method
- A quasi-Newton interior point method for semi-infinite programming
- The semismooth approach for semi-infinite programming under the reduction ansatz
Cited in
(46)- Global solution of bilevel programs with a nonconvex inner program
- An algorithm for the global optimization of a class of continuous minimax problems
- A noninterior point homotopy method for semi-infinite programming problems
- Sufficient optimality and sensitivity analysis of a parameterized min-max programming
- A lifting method for generalized semi-infinite programs based on lower level Wolfe duality
- Semi-infinite programming method for optimal power flow with transient stability and variable clearing time of faults
- Solving bilevel programs with the KKT-approach
- Convergence of an interior point algorithm for continuous minimax
- Global solution of nonlinear mixed-integer bilevel programs
- Optimality conditions and duality for multiobjective semi-infinite programming on Hadamard manifolds
- How to solve a semi-infinite optimization problem
- Discretization-based algorithms for generalized semi-infinite and bilevel programs with coupling equality constraints
- A homotopy interior point method for semi-infinite programming problems
- A smoothing Levenberg-Marquardt method for generalized semi-infinite programming
- Computation algorithm for convex semi-infinite program with second-order cones: special analyses for affine and quadratic case
- How to solve a design centering problem
- Nonlinear robust optimization via sequential convex bilevel programming
- Dynamic optimization of nonlinear systems with guaranteed feasibility of inequality-path-constraints
- Lower level duality and the global solution of generalized semi-infinite programs
- An interior point constraint generation algorithm for semi-infinite optimization with health-care application
- Solving disjunctive optimization problems by generalized semi-infinite optimization techniques
- Interior point filter method for semi-infinite programming problems
- Solving generalized semi-infinite programs by reduction to simpler problems
- Branch-and-sandwich: a deterministic global optimization algorithm for optimistic bilevel programming problems. I: theoretical development
- Solving semi-infinite programs by smoothing projected gradient method
- Global optimization of generalized semi-infinite programs via restriction of the right hand side
- A collision detection approach for maximizing the material utilization
- On solving a class of linear semi-infinite programming by SDP method
- BOLIB: bilevel Optimization LIBrary of test problems
- Convergent Algorithms for a Class of Convex Semi-infinite Programs
- An adaptive discretization method solving semi-infinite optimization problems with quadratic rate of convergence
- Projection: A unified approach to semi-infinite linear programs and duality in convex programming
- A survey of nonlinear robust optimization
- Feasible method for generalized semi-infinite programming
- Recent advances in nonconvex semi-infinite programming: applications and algorithms
- Equilibrium modeling and solution approaches inspired by nonconvex bilevel programming
- Second-order optimality conditions and duality for multiobjective semi-infinite programming problems on Hadamard manifolds
- Bounding-focused discretization methods for the global optimization of nonconvex semi-infinite programs
- Polynomial optimization relaxations for generalized semi-infinite programs
- Discretization algorithms for generalized semi-infinite programs with coupling equality constraints under local solution stability
- Convex semi-infinite programming algorithms with inexact separation oracles
- Derivative-enhanced lower-Bounding in adaptive discretization for the global solution of semi-infinite optimization problems
- Semi-infinite programming
- On generalized semi-infinite programming. (With comments and rejoinder).
- Generalized semi-infinite programming: a tutorial
- Application of general semi-infinite programming to lapidary cutting problems
This page was built for publication: Solving Semi-Infinite Optimization Problems with Interior Point Techniques
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4443016)
