Solving Semi-Infinite Optimization Problems with Interior Point Techniques
From MaRDI portal
Publication:4443016
DOI10.1137/S0363012901398393zbMath1046.90093OpenAlexW1991334712MaRDI QIDQ4443016
Publication date: 8 January 2004
Published in: SIAM Journal on Control and Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s0363012901398393
smoothingconvexityoptimality conditiongeneralized semi-infinite optimizationStackelberg gamenonlinear complementarity problem function
Numerical mathematical programming methods (65K05) Convex programming (90C25) Numerical methods based on nonlinear programming (49M37) Semi-infinite programming (90C34)
Related Items (39)
A survey of nonlinear robust optimization ⋮ Convergent Algorithms for a Class of Convex Semi-infinite Programs ⋮ Solving disjunctive optimization problems by generalized semi-infinite optimization techniques ⋮ 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 ⋮ Semi-infinite programming ⋮ On generalized semi-infinite programming. (With comments and rejoinder). ⋮ 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 ⋮ An adaptive discretization method solving semi-infinite optimization problems with quadratic rate of convergence ⋮ A lifting method for generalized semi-infinite programs based on lower level Wolfe duality ⋮ Recent advances in nonconvex semi-infinite programming: applications and algorithms ⋮ Semi-infinite programming method for optimal power flow with transient stability and variable clearing time of faults ⋮ Equilibrium modeling and solution approaches inspired by nonconvex bilevel programming ⋮ Solving bilevel programs with the KKT-approach ⋮ Nonlinear robust optimization via sequential convex bilevel programming ⋮ Convergence of an interior point algorithm for continuous minimax ⋮ Global solution of nonlinear mixed-integer bilevel programs ⋮ Generalized semi-infinite programming: a tutorial ⋮ Application of general semi-infinite programming to lapidary cutting 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 ⋮ A noninterior point homotopy method for semi-infinite programming problems ⋮ Solving generalized semi-infinite programs by reduction to simpler problems ⋮ How to solve a semi-infinite optimization problem ⋮ Sufficient optimality and sensitivity analysis of a parameterized min-max programming ⋮ Discretization-based algorithms for generalized semi-infinite and bilevel programs with coupling equality constraints ⋮ Lower level duality and the global solution of generalized semi-infinite programs ⋮ Global solution of bilevel programs with a nonconvex inner program ⋮ On solving a class of linear semi-infinite programming by SDP method ⋮ An algorithm for the global optimization of a class of continuous minimax problems ⋮ Interior point filter method for semi-infinite programming problems ⋮ Optimality conditions and duality for multiobjective semi-infinite programming on Hadamard manifolds ⋮ Projection: A Unified Approach to Semi-Infinite Linear Programs and Duality in Convex Programming ⋮ BOLIB: Bilevel Optimization LIBrary of Test Problems
This page was built for publication: Solving Semi-Infinite Optimization Problems with Interior Point Techniques
