A comparative study of several semi-infinite nonlinear programming algorithms
DOI10.1016/0377-2217(88)90010-0zbMATH Open0643.90079OpenAlexW1965209365MaRDI QIDQ1102202FDOQ1102202
Authors: Yoshihiro Tanaka, Masao Fukushima, Toshihide Ibaraki 
Publication date: 1988
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(88)90010-0
Recommendations
- scientific article; zbMATH DE number 1534451
- A comparative note on the relaxation algorithms for the linear semi-infinite feasibility problem
- Comparative study of RPSALG algorithm for convex semi-infinite programming
- Introduction of some algorithms for nonlinear semidefinite programming
- On Linear Semi-Infinite Programming Problems: An Algorithm
- scientific article; zbMATH DE number 1215251
- Publication:3484647
- Recent advances in nonconvex semi-infinite programming: applications and algorithms
- scientific article; zbMATH DE number 1985305
- scientific article; zbMATH DE number 1186924
global convergencerelative efficiencyfeasible directionRobustnesssuccessive quadratic programmingcomputational comparisonsemi-infinite nonlinear programming algorithms
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Semi-infinite programming (90C34)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- A globally convergent SQP method for semi-infinite nonlinear optimization
- An exact penalty function for semi-infinite programming
- An improved algorithm for optimization problems with functional inequality constraints
- Title not available (Why is that?)
- Title not available (Why is that?)
- A projected lagrangian algorithm for semi-infinite programming
- Title not available (Why is that?)
- Title not available (Why is that?)
- ImplementableL∞penalty-function method for semi-infinite optimization
- A recursive quadratic programming algorithm for semi-infinite optimization problems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (14)
- A reduction method for semi-infinite programming by means of a global stochastic approach†
- On the numerical treatment of linearly constrained semi-infinite optimization problems
- Computation of Lyapunov functions for smooth nonlinear systems using convex optimization
- A comparative study on optimization methods for the constrained nonlinear programming problems
- Interior point filter method for semi-infinite programming problems
- Solving nonlinear programming problems with very many constraints
- Title not available (Why is that?)
- An \(\epsilon\)-active barrier-function method for solving minimax problems
- Finite-termination schemes for solving semi-infinite satisfycing problems
- Identification of nonlinear systems using empirical data and prior knowledge -- An optimization approach
- New descent rules for solving the linear semi-infinite programming problem
- A barrier function method for minimax problems
- Title not available (Why is that?)
- The stability of the maximum entropy method for nonsmooth semi-infinite programmings
This page was built for publication: A comparative study of several semi-infinite nonlinear programming algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1102202)
