Solving convex programs with infinitely many linear constraints by a relaxed cutting plane method

DOI10.1016/S0898-1221(99)00203-5zbMath0931.90035OpenAlexW1971468044MaRDI QIDQ1963110

Soon-Yi Wu, Shu-Cherng Fang

Publication date: 20 January 2000

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0898-1221(99)00203-5

zbMATH Keywords

duality theorycutting plane methodconvex semi-infinite programming

Mathematics Subject Classification ID

Convex programming (90C25) Programming in abstract spaces (90C48) Semi-infinite programming (90C34)

Related Items (12)

Constrained incremental bundle method with partial inexact oracle for nonsmooth convex semi-infinite programming problems ⋮ Tight Bounds for Cost-Sharing in Weighted Congestion Games ⋮ Computation algorithm for convex semi-infinite program with second-order cones: special analyses for affine and quadratic case ⋮ Some properties on quadratic infinite programs of integral type ⋮ An entropy based central cutting plane algorithm for convex min-Max semi-infinite programming problems ⋮ Global convergence of a class of smooth penalty methods for semi-infinite programming ⋮ A sequential quadratic programming with a dual parametrization approach to nonlinear semi-infinite programming ⋮ Solving semi-infinite programs by smoothing projected gradient method ⋮ A quasi-Newton interior point method for semi-infinite programming ⋮ Linear semi-infinite programming theory: an updated survey ⋮ On Solving the Convex Semi-Infinite Minimax Problems via Superlinear 𝒱𝒰 Incremental Bundle Technique with Partial Inexact Oracle ⋮ A smoothing Levenberg-Marquardt algorithm for semi-infinite programming

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Entropy optimization and mathematical programming
• Relaxed cutting plane method for solving linear semi-infinite programming problems
• Semi-Infinite Programming: Theory, Methods, and Applications
• A cutting-plane method for quadratic semi infinite programming problems
• An inexact approach to solving linear semi-infinite programming problems
• On Linear Semi-Infinite Programming Problems: An Algorithm
• An Unconstrained Convex Programming Approach to Linear Semi-Infinite Programming
• 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 convex programs with infinitely many linear constraints by a relaxed cutting plane method