An entire space polynomial-time algorithm for linear programming (Q2442633): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The ellipsoid method and its consequences in combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A deep cut ellipsoid algorithm for convex programming: Theory and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4856863 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primal and dual convergence of a proximal point exponential penalty method for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the entropic perturbation and exponential penalty methods for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modified barrier functions (theory and methods) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Numerical experiments with an interior-exterior point method for nonlinear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the convergence of the exponential multiplier method for convex programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonlinear rescaling and proximal-like methods in convex optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonlinear rescaling vs. smoothing technique in convex optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Primal-Dual Exterior Point Method for Nonlinear Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primal-dual nonlinear rescaling method for convex optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primal–dual exterior point method for convex optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: 1.5-\(Q\)-superlinear convergence of an exterior-point method for constrained optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primal-dual nonlinear rescaling method with dynamic scaling parameter update / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4324980 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Mathematical View of Interior-Point Methods in Convex Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821526 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The interior-point revolution in optimization: History, recent developments, and lasting consequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new polynomial-time algorithm for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Self-concordant functions for optimization on smooth manifolds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3655929 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursive construction of optimal self-concordant barriers for homogeneous cones / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-time interior-point algorithm based on a local self-concordant finite barrier function / rank
 
Normal rank
Property / cites work
 
Property / cites work: A primal-dual infeasible-interior-point algorithm for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of self-regular proximity based infeasible IPMs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Full-Newton Step O(n) Infeasible Interior-Point Algorithm for Linear Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simplified<i>O</i>(<i>nL</i>) infeasible interior-point algorithm for linear optimization using full-Newton steps / rank
 
Normal rank
Property / cites work
 
Property / cites work: A non-interior predictor-corrector path following algorithm for the monotone linear complementarity problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Globally and Locally Superlinearly Convergent Non--Interior-Point Algorithm for P<sub>0</sub>LCPs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A complexity analysis of a smoothing method using CHKS-functions for monotone linear complementarity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of a noninterior path-following method for the linear complementarity problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: New self-concordant barrier for the hypercube / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial-time algorithm, based on Newton's method, for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5385318 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3050157 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Khachiyan’s algorithm for linear programming / rank
 
Normal rank

Latest revision as of 12:31, 7 July 2024

scientific article
Language Label Description Also known as
English
An entire space polynomial-time algorithm for linear programming
scientific article

    Statements

    An entire space polynomial-time algorithm for linear programming (English)
    0 references
    1 April 2014
    0 references
    polynomial-time algorithm
    0 references
    linear programming
    0 references
    entire space
    0 references
    self-concordance
    0 references
    penalty function
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers