Relaxed cutting plane method with convexification for solving nonlinear semi-infinite programming problems
From MaRDI portal
Publication:694542
DOI10.1007/s10589-011-9452-9zbMath1259.90148OpenAlexW2016386684MaRDI QIDQ694542
Publication date: 12 December 2012
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-011-9452-9
cutting plane methodnonlinear semi-infinite programmingcontrol design problemconvexification approximation
Related Items
A feasible proximal bundle algorithm with convexification for nonsmooth, nonconvex semi-infinite programming ⋮ Primal-dual path following method for nonlinear semi-infinite programs with semi-definite constraints ⋮ Optimality analysis of a class of semi-infinite programming problems ⋮ Solving semi-infinite programs by smoothing projected gradient method
Cites Work
- Unnamed Item
- A computational algorithm for functional inequality constrained optimization problems
- A smoothing projected Newton-type algorithm for semi-infinite programming
- A globally convergent SQP method for semi-infinite nonlinear optimization
- Optimization. Algorithms and consistent approximations
- An accelerated central cutting plane algorithm for linear semi-infinite programming
- Interval methods for semi-infinite programs
- Global solution of semi-infinite programs
- Numerical experiments in semi-infinite programming
- A New Exchange Method for Convex Semi-Infinite Programming
- Semi-Infinite Programming: Theory, Methods, and Applications
- A hybrid algorithm for infinitely constrained optimization
- An iterative method for solving KKT system of the semi-infinite programming
- The Adaptive Convexification Algorithm: A Feasible Point Method for Semi-Infinite Programming
- Semi-infinite programming, duality, discretization and optimality conditions†
- An improved algorithm for optimization problems with functional inequality constraints
- A Central Cutting Plane Algorithm for Convex Semi-Infinite Programming Problems
- THE SIMULTANEOUS APPROXIMATION OF MAGNITUDE AND PHASE BY FIR DIGITAL FILTERS. I: A NEW APPROACH
- Local Convergence of SQP Methods in Semi-Infinite Programming
- A Truncated Projected Newton-Type Algorithm for Large-Scale Semi-infinite Programming
- Computational discretization algorithms for functional inequality constrained optimization
- Discretization in semi-infinite programming: the rate of convergence
- The direct solution of nonconvex nonlinear FIR filter design problems by a SIP method
