Analytic center based cutting plane method for linear semi-infinite programming.

MaRDI QIDQ2776654zbMATH OpenFDO

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

Publication date 2001

Mathematics Subject Classification ID

Semi-infinite programming (90C34) Methods of quasi-Newton type (90C53)

Recommendations

• scientific article; zbMATH DE number 3984967
• An accelerated central cutting plane algorithm for linear semi-infinite programming
• A Central Cutting Plane Algorithm for Convex Semi-Infinite Programming Problems
• An analytic center cutting plane approach for conic programming
• Relaxed cutting plane method for solving linear semi-infinite programming problems

Cited in

(6)

• An accelerated central cutting plane algorithm for linear semi-infinite programming
• An analytic center cutting plane method for solving semi-infinite variational inequality problems
• Linear semi-infinite programming theory: an updated survey
• An entropy based central cutting plane algorithm for convex min-Max semi-infinite programming problems
• A cutting-plane method for quadratic semi infinite programming problems
• A Multiple-Cut Analytic Center Cutting Plane Method for Semidefinite Feasibility Problems

This page was built for publication: Analytic center based cutting plane method for linear semi-infinite programming.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2776654)