A noninterior point homotopy method for semi-infinite programming problems
DOI10.1007/s12190-016-1067-yzbMath1390.90535OpenAlexW2551401232MaRDI QIDQ1743361
Mengsi Li, Furong Gao, Xiaona Fan
Publication date: 13 April 2018
Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12190-016-1067-y
Probabilistic models, generic numerical methods in probability and statistics (65C20) Nonlinear programming (90C30) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Numerical methods for initial value problems involving ordinary differential equations (65L05)
Related Items (1)
Cites Work
- Solving semi-infinite programs by smoothing projected gradient method
- Semi-infinite programming
- A new smoothing Newton-type algorithm for semi-infinite programming
- Stability of indices in the KKT conditions and metric regularity in convex semi-infinite optimization
- Optimization. Algorithms and consistent approximations
- Semi-infinite programming. Workshop, Cottbus, Germany, September 1996
- Semismooth Newton methods for solving semi-infinite programming problems
- A smoothing Newton method for semi-infinite programming
- Global solution of semi-infinite programs
- On the numerical treatment of linearly constrained semi-infinite optimization problems
- A homotopy interior point method for semi-infinite programming problems
- An exchange method with refined subproblems for convex semi-infinite programming problems
- A New Exchange Method for Convex Semi-Infinite Programming
- Solving Semi-Infinite Optimization Problems with Interior Point Techniques
- Discretization in semi-infinite programming: the rate of convergence
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A noninterior point homotopy method for semi-infinite programming problems
