Implementing the simplex method as a cutting-plane method, with a view to regularization (Q377719): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Solving Real-World Linear Programs: A Decade and More of Progress / rank
 
Normal rank
Property / cites work
 
Property / cites work: The simplex method. A probabilistic analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Newton's method for convex programming and Tschebyscheff approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5808752 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3844775 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized upper bounding techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Practical Geometrically Convergent Cutting Plane Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Interior Point Constraint Generation Algorithm for Semi-Infinite Optimization with Health-Care Application / rank
 
Normal rank
Property / cites work
 
Property / cites work: A central cutting plane algorithm for the convex programming problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bundle-type methods for inexact data / rank
 
Normal rank
Property / cites work
 
Property / cites work: A computational study of a solver system for processing two-stage stochastic LPs with enhanced Benders decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: A regularized simplex method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Processing second-order stochastic dominance models using cutting-plane representations / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a dual method for a specially structured linear programming problem with application to stochastic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving two-stage stochastic programming problems with level decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Steepest-edge simplex algorithms for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition and Nondifferentiable Optimization with the Projective Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pivot selection methods of the Devex LP code / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic linear programming. Models, theory, and computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Cutting-Plane Method for Solving Convex Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proximal level bundle methods for convex nondifferentiable optimization, saddle-point problems and variational inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4051879 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integrated chance constraints: reduced forms and an algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Progress in the dual simplex algorithm for solving large scale LP problems: Techniques for a fast and stable implementation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Progress in the dual simplex method for large scale LP problems: Practical dual phase 1 algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Inequalities and Related Systems. (AM-38) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational aspects of minimizing conditional value-at-risk / rank
 
Normal rank
Property / cites work
 
Property / cites work: New variants of bundle methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5336851 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Formulations for Optimization under Stochastic Dominance Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generalized dual phase-2 simplex algorithm. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A piecewise linear dual phase-1 algorithm for the simplex method / rank
 
Normal rank
Property / cites work
 
Property / cites work: A general pricing scheme for the simplex method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational techniques of the simplex method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Level bundle methods for oracles with on-demand accuracy / rank
 
Normal rank
Property / cites work
 
Property / cites work: A proximal cutting plane method using Chebychev center for nonsmooth convex optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear optimization and extensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient nested pricing in the simplex algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization Problems with Second Order Stochastic Dominance Constraints: Duality, Compact Formulations, and Cut Generation Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smoothed analysis of algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pivot rules for linear programming: A survey on recent theoretical developments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear programming. Foundations and extensions / rank
 
Normal rank

Revision as of 00:11, 7 July 2024

scientific article
Language Label Description Also known as
English
Implementing the simplex method as a cutting-plane method, with a view to regularization
scientific article

    Statements

    Implementing the simplex method as a cutting-plane method, with a view to regularization (English)
    0 references
    0 references
    0 references
    0 references
    7 November 2013
    0 references
    simplex method
    0 references
    cutting-plane method
    0 references
    linear programming
    0 references
    convex programming
    0 references
    stochastic programming
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers