Solving quadratic semi-infinite programming problems by using relaxed cutting-plane scheme

DOI10.1016/S0377-0427(00)00544-6zbMath0984.65062OpenAlexW2032061794WikidataQ60241123 ScholiaQ60241123MaRDI QIDQ5936072

Shu-Cherng Fang, Soon-Yi Wu, Chih-Jen Lin

Publication date: 12 May 2002

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-0427(00)00544-6

zbMATH Keywords

convergencequadratic programminginterior-point methodnumerical experimentsrelaxationsemi-infinite programmingcutting-plane schemeexplicit constraints

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Interior-point methods (90C51) Semi-infinite programming (90C34)

Related Items (11)

Convergent Algorithms for a Class of Convex Semi-infinite Programs ⋮ Constrained incremental bundle method with partial inexact oracle for nonsmooth convex semi-infinite programming problems ⋮ A solution method for combined semi-infinite and semi-definite programming ⋮ Non-convex semi-infinite min-max optimization with noncompact sets ⋮ A class of comprehensive constraints for design of PCWLSE Laguerre and FIR filters: a boost in performance ⋮ Convex Optimization for Group Feature Selection in Networked Data ⋮ Solving semi-infinite programs by smoothing projected gradient method ⋮ Detecting and solving aircraft conflicts using bilevel programming ⋮ Learning Data Manifolds with a Cutting Plane Method ⋮ Algorithms for infinite quadratic programming in \(L_p\) spaces ⋮ On Solving the Convex Semi-Infinite Minimax Problems via Superlinear 𝒱𝒰 Incremental Bundle Technique with Partial Inexact Oracle

Uses Software

• Matlab

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A one-phase algorithm for semi-infinite linear programming
• An interior point algorithm for semi-infinite linear programming
• Optimization. Algorithms and consistent approximations
• Entropy optimization and mathematical programming
• A primal-dual infeasible-interior-point algorithm for linear semi- infinite programming
• Relaxed cutting plane method for solving linear semi-infinite programming problems
• Semi-Infinite Programming: Theory, Methods, and Applications
• A Fast Algorithm for Linear Complex Chebyshev Approximations
• On the Implementation of a Primal-Dual Interior Point Method
• On Linear Semi-Infinite Programming Problems: An Algorithm
• On solving convex quadratic semi-infinite programming probelms
• Numerical treatment of a class of semi‐infinite programming problems

This page was built for publication: Solving quadratic semi-infinite programming problems by using relaxed cutting-plane scheme