A globally convergent algorithm with adaptively refined discretization for semi-infinite optimization problems arising in engineering design
From MaRDI portal
Publication:3475920
DOI10.1109/9.29441zbMath0698.49023OpenAlexW1990320206MaRDI QIDQ3475920
Publication date: 1989
Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/1903/4749
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (15)
A SSLE-Type Algorithm of Quasi-Strongly Sub-Feasible Directions for Inequality Constrained Minimax Problems ⋮ Some outer approximation methods for semi-infinite optimization problems ⋮ A globally convergent QP-free algorithm for inequality constrained minimax optimization ⋮ Substitution secant/finite difference method to large sparse minimax problems ⋮ A new exact penalty method for semi-infinite programming problems ⋮ A nonlinear norm-relaxed method for finely discretized semi-infinite optimization problems ⋮ On the numerical treatment of linearly constrained semi-infinite optimization problems ⋮ A norm-relaxed method of feasible directions for finely discretized problems from semi-infinite programming ⋮ On solving large-scale finite minimax problems using exponential smoothing ⋮ An iterative method for solving KKT system of the semi-infinite programming ⋮ A multi-local optimization algorithm ⋮ Numerical experiments in semi-infinite programming ⋮ Path-following proximal approach for solving ill-posed convex semi-infinite programming problems ⋮ Convergence properties of a class of exact penalty methods for semi-infinite optimization problems ⋮ A dual parameterization approach to linear-quadratic semi-infinite programming problems
This page was built for publication: A globally convergent algorithm with adaptively refined discretization for semi-infinite optimization problems arising in engineering design
