Relaxed cutting plane method with convexification for solving nonlinear semi-infinite programming problems
From MaRDI portal
Publication:694542
DOI10.1007/S10589-011-9452-9zbMATH Open1259.90148OpenAlexW2016386684MaRDI QIDQ694542FDOQ694542
Authors: Ting-Jang Shiu, Soon-Yi Wu 
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
Recommendations
- The Adaptive Convexification Algorithm: A Feasible Point Method for Semi-Infinite Programming
- A Central Cutting Plane Algorithm for Convex Semi-Infinite Programming Problems
- Solving quadratic semi-infinite programming problems by using relaxed cutting-plane scheme
- A feasible proximal bundle algorithm with convexification for nonsmooth, nonconvex semi-infinite programming
- The adaptive convexification algorithm for semi-infinite programming with arbitrary index sets
cutting plane methodcontrol design problemconvexification approximationnonlinear semi-infinite programming
Cites Work
- Optimization. Algorithms and consistent approximations
- Semi-Infinite Programming: Theory, Methods, and Applications
- Title not available (Why is that?)
- A smoothing projected Newton-type algorithm for semi-infinite programming
- A globally convergent SQP method for semi-infinite nonlinear optimization
- Global solution of semi-infinite programs
- A new exchange method for convex semi-infinite programming
- An iterative method for solving KKT system of the semi-infinite programming
- A Central Cutting Plane Algorithm for Convex Semi-Infinite Programming Problems
- 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
- Semi-infinite programming, duality, discretization and optimality conditions†
- An improved algorithm for optimization problems with functional inequality constraints
- An accelerated central cutting plane algorithm for linear semi-infinite programming
- Numerical experiments in semi-infinite programming
- A computational algorithm for functional inequality constrained optimization problems
- A hybrid algorithm for infinitely constrained optimization
- Interval methods for semi-infinite programs
- The Adaptive Convexification Algorithm: A Feasible Point Method for Semi-Infinite Programming
- THE SIMULTANEOUS APPROXIMATION OF MAGNITUDE AND PHASE BY FIR DIGITAL FILTERS. I: A NEW APPROACH
- Local Convergence of SQP Methods in Semi-Infinite Programming
- The direct solution of nonconvex nonlinear FIR filter design problems by a SIP method
Cited In (9)
- A new approach for nonconvex SIP
- A feasible proximal bundle algorithm with convexification for nonsmooth, nonconvex semi-infinite programming
- A Cutting Surface Algorithm for Semi-Infinite Convex Programming with an Application to Moment Robust Optimization
- Solving semi-infinite programs by smoothing projected gradient method
- Primal-dual path following method for nonlinear semi-infinite programs with semi-definite constraints
- Solving quadratic semi-infinite programming problems by using relaxed cutting-plane scheme
- A relaxed cutting plane method for semi-infinite semi-definite programming
- Optimality analysis of a class of semi-infinite programming problems
- The adaptive convexification algorithm for semi-infinite programming with arbitrary index sets
This page was built for publication: Relaxed cutting plane method with convexification for solving nonlinear semi-infinite programming problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q694542)
