Approximate Farkas lemmas and stopping rules for iterative infeasible-point algorithms for linear programming (Q1290596): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q173843
Created claim: DBLP publication ID (P1635): journals/mp/ToddY98, #quickstatements; #temporary_batch_1731530891435
 
(5 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Michael J. Todd / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / 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: Q3818127 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Path-Following Methods for Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4296156 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Potential-reduction methods in mathematical programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding an interior point in the optimal face of linear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A primal-dual interior point method whose running time depends only on the constraint matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for error in the solution set of a perturbed linear program / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4742548 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dual gauge programs, with applications to quadratic programming and the minimum-norm problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some perturbation theory for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On minimum norm solutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3696875 / 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: Feasibility issues in a primal-dual interior-point method for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational experience with a primal-dual interior point method for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomiality of infeasible-interior-point algorithms for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Infeasible-Interior-Point Predictor-Corrector Algorithm for Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A quadratically convergent predictor-corrector method for solving linear programs from infeasible starting points / rank
 
Normal rank
Property / cites work
 
Property / cites work: An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Convergence of a Class of Infeasible Interior-Point Methods for the Horizontal Linear Complementarity Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximations to Solutions to Systems of Linear Inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: On \(\ell_ p\) programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence behavior of interior-point algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simplified homogeneous and self-dual linear programming algorithm and its implementation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Basic lemmas in polynomial-time infeasible-interior-point methods for linear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On polynomiality of the Mehrotra-type predictor-corrector interior-point algorithms / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q92422326 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf01584841 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1988287493 / rank
 
Normal rank
Property / DBLP publication ID
 
Property / DBLP publication ID: journals/mp/ToddY98 / rank
 
Normal rank

Latest revision as of 22:01, 13 November 2024

scientific article
Language Label Description Also known as
English
Approximate Farkas lemmas and stopping rules for iterative infeasible-point algorithms for linear programming
scientific article

    Statements

    Approximate Farkas lemmas and stopping rules for iterative infeasible-point algorithms for linear programming (English)
    0 references
    0 references
    0 references
    28 June 1999
    0 references
    linear programming
    0 references
    Farkas lemma
    0 references
    infeasible-interior-point methods
    0 references
    stopping rules
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers