Relaxed cutting plane method with convexification for solving nonlinear semi-infinite programming problems

DOI10.1007/S10589-011-9452-9MaRDI QIDQ694542zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

cutting plane methodcontrol design problemconvexification approximationnonlinear semi-infinite programming

Mathematics Subject Classification ID

Semi-infinite programming (90C34)

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

Cites work

• scientific article; zbMATH DE number 1186924 (Why is no real title available?)
• A Central Cutting Plane Algorithm for Convex Semi-Infinite Programming Problems
• A Truncated Projected Newton-Type Algorithm for Large-Scale Semi-infinite Programming
• A computational algorithm for functional inequality constrained optimization problems
• A globally convergent SQP method for semi-infinite nonlinear optimization
• A hybrid algorithm for infinitely constrained optimization
• A new exchange method for convex semi-infinite programming
• A smoothing projected Newton-type algorithm for semi-infinite programming
• An accelerated central cutting plane algorithm for linear semi-infinite programming
• An improved algorithm for optimization problems with functional inequality constraints
• An iterative method for solving KKT system of the semi-infinite programming
• Computational discretization algorithms for functional inequality constrained optimization
• Discretization in semi-infinite programming: the rate of convergence
• Global solution of semi-infinite programs
• Interval methods for semi-infinite programs
• Local Convergence of SQP Methods in Semi-Infinite Programming
• Numerical experiments in semi-infinite programming
• Optimization. Algorithms and consistent approximations
• Semi-Infinite Programming: Theory, Methods, and Applications
• Semi-infinite programming, duality, discretization and optimality conditions†
• THE SIMULTANEOUS APPROXIMATION OF MAGNITUDE AND PHASE BY FIR DIGITAL FILTERS. I: A NEW APPROACH
• The Adaptive Convexification Algorithm: A Feasible Point Method for 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)