Relaxed cutting plane method with convexification for solving nonlinear semi-infinite programming problems
type: Item
instance of: scholarly article
title: Relaxed cutting plane method with convexification for solving nonlinear semi-infinite programming problems
zbMATH Open document ID: 1259.90148
author: Ting-Jang Shiu
author: Soon-Yi Wu
published in: Computational Optimization and Applications
publication date: 2012-12-12T00:00:00Z
Mathematics Subject Classification ID: 90C34
zbMATH DE Number: 6115327
zbMATH Keywords: nonlinear semi-infinite programming
zbMATH Keywords: convexification approximation
zbMATH Keywords: cutting plane method
zbMATH Keywords: control design problem
MaRDI profile type: Publication
full work available at URL: s10589-011-9452-9
OpenAlex ID: W2016386684
cites work: A hybrid algorithm for infinitely constrained optimization
cites work: An accelerated central cutting plane algorithm for linear semi-infinite programming
cites work: Interval methods for semi-infinite programs
cites work: Global solution of semi-infinite programs
cites work: The Adaptive Convexification Algorithm: A Feasible Point Method for Semi-Infinite Programming
cites work: An improved algorithm for optimization problems with functional inequality constraints
cites work: The direct solution of nonconvex nonlinear FIR filter design problems by a SIP method
cites work: Local Convergence of SQP Methods in Semi-Infinite Programming
cites work: Semi-Infinite Programming: Theory, Methods, and Applications
cites work: A computational algorithm for functional inequality constrained optimization problems
cites work: A Central Cutting Plane Algorithm for Convex Semi-Infinite Programming Problems
cites work: A Truncated Projected Newton-Type Algorithm for Large-Scale Semi-infinite Programming
cites work: THE SIMULTANEOUS APPROXIMATION OF MAGNITUDE AND PHASE BY FIR DIGITAL FILTERS. I: A NEW APPROACH
cites work: Numerical experiments in semi-infinite programming
cites work: Optimization. Algorithms and consistent approximations
cites work: A smoothing projected Newton-type algorithm for semi-infinite programming
cites work: Q3840143
cites work: Semi-infinite programming, duality, discretization and optimality conditions†
cites work: Discretization in semi-infinite programming: the rate of convergence
cites work: A globally convergent SQP method for semi-infinite nonlinear optimization
cites work: Computational discretization algorithms for functional inequality constrained optimization
cites work: An iterative method for solving KKT system of the semi-infinite programming
cites work: A New Exchange Method for Convex Semi-Infinite Programming
DOI: 10.1007/S10589-011-9452-9
description: scientific article; zbMATH DE number 6115327