A globally convergent SQP method for semi-infinite nonlinear optimization
From MaRDI portal
Publication:1262218
DOI10.1016/0377-0427(88)90276-2zbMath0685.90080OpenAlexW1993127888MaRDI QIDQ1262218
Toshihide Ibaraki, Yoshihiro Tanaka, Masao Fukushima
Publication date: 1988
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-0427(88)90276-2
global convergencepenalty functionsuccessive quadratic programmingtrust region techniquenonlinear semi-infinite optimization
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Quadratic programming (90C20) Semi-infinite programming (90C34)
Related Items
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, Global convergence of a robust smoothing SQP method for semi-infinite programming, Some outer approximation methods for semi-infinite optimization problems, Study of a special nonlinear problem arising in convex semi-infinite programming, A comparative study of several semi-infinite nonlinear programming algorithms, Non-convex semi-infinite min-max optimization with noncompact sets, Primal-dual path following method for nonlinear semi-infinite programs with semi-definite constraints, Stability analysis of stochastic programs with second order dominance constraints, An augmented Lagrangian algorithm for solving semiinfinite programming, Filter trust region method for nonlinear semi-infinite programming problem, Semidefinite relaxations for semi-infinite polynomial programming, Solving semi-infinite programs by smoothing projected gradient method, An interior point sequential quadratic programming-type method for log-determinant semi-infinite programs, Relaxed cutting plane method with convexification for solving nonlinear semi-infinite programming problems, A new smoothing Newton-type algorithm for semi-infinite programming, A smoothing Newton method for semi-infinite programming, An iterative method for solving KKT system of the semi-infinite programming, Local reduction based SQP-type method for semi-infinite programs with an infinite number of second-order cone constraints, An exact penalty function algorithm for semi-infinite programmes, Numerical experiments in semi-infinite programming, A reduction method for semi-infinite programming by means of a global stochastic approach†, An Efficient Algorithm for Min-Max Convex Semi-Infinite Programming Problems, A new adaptive method to nonlinear semi-infinite programming, On Solving the Convex Semi-Infinite Minimax Problems via Superlinear 𝒱𝒰 Incremental Bundle Technique with Partial Inexact Oracle, A smoothing Levenberg-Marquardt algorithm for semi-infinite programming
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Globally convergent methods for semi-infinite programming
- A recursive quadratic programming algorithm for semi-infinite optimization problems
- On the use of ε-most-active constraints in an exact penalty function method for nonlinear optimization
- A projected lagrangian algorithm for semi-infinite programming
- An exact penalty function for semi-infinite programming
- ImplementableL∞penalty-function method for semi-infinite optimization
- Exact penalty functions in nonlinear programming
- An improved algorithm for optimization problems with functional inequality constraints
- Generalized Gradients and Applications
