A regularized simplex method

DOI10.1007/S10100-014-0344-9MaRDI QIDQ302140zbMATHOpenAlexFDO

Authors Csaba I. Fábián, Krisztián Eretnek, Olga Papp

Publication date 4 July 2016

Published in CEJOR. Central European Journal of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10100-014-0344-9

zbMATH Keywords

linear programmingregularizationconvex programmingcutting-plane methodssimplex method

Mathematics Subject Classification ID

Convex programming (90C25) Linear programming (90C05) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Methods of quasi-Newton type (90C53) Extreme-point and pivoting methods (90C49)

Recommendations

• Implementing the simplex method as a cutting-plane method, with a view to regularization
• The adventures of a simple algorithm
• scientific article; zbMATH DE number 4170640
• The generalized simplex method
• A simplex-like method with bisection for linear programming¹

Cites work

• scientific article; zbMATH DE number 3833697 (Why is no real title available?)
• scientific article; zbMATH DE number 995813 (Why is no real title available?)
• scientific article; zbMATH DE number 3177183 (Why is no real title available?)
• A Practical Geometrically Convergent Cutting Plane Algorithm
• A computational study of a solver system for processing two-stage stochastic LPs with enhanced Benders decomposition
• A regularized decomposition method for minimizing a sum of polyhedral functions
• Accelerating the regularized decomposition method for two stage stochastic linear problems
• An enhanced model for portfolio choice with SSD criteria: a constructive approach
• Approximate level method for nonsmooth convex minimization
• Computational techniques of the simplex method
• Decomposition algorithms for stochastic programming on a computational grid
• Efficient nested pricing in the simplex algorithm
• Evolution of linear programming computing techniques
• Exact penalization, level function method, and modified cutting-plane method for stochastic programs with second order stochastic dominance constraints
• Implementing the simplex method as a cutting-plane method, with a view to regularization
• Inexact bundle methods for two-stage stochastic programming
• New variants of bundle methods
• Pivot rules for linear programming: A survey on recent theoretical developments
• Scaling linear optimization problems prior to application of the simplex method
• Solving generation expansion planning problems with environmental constraints by a bundle method
• Solving two-stage stochastic programming problems with level decomposition
• The gravitational method for linear programming

Cited in

(9)

• Implementing the simplex method as a cutting-plane method, with a view to regularization
• A forward convex-simplex method
• A conjugate Rosen's gradient projection method with global line search for piecewise linear concave optimization
• Editorial
• Regular and Mercerian Generalized Lototsky Method
• Piecewise linear regularized solution paths
• A numerically exact implementation of the simplex method
• A regularized decomposition method for minimizing a sum of polyhedral functions
• Spectral simplex method

This page was built for publication: A regularized simplex method

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