The complexity of self-regular proximity based infeasible IPMs (Q2506182): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(8 intermediate revisions by 6 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10589-005-3064-1 / rank
Normal rank
 
Property / author
 
Property / author: Tamás Terlaky / rank
Normal rank
 
Property / author
 
Property / author: Tamás Terlaky / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: LIPSOL / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: WSMP / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10589-005-3064-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2024962211 / 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: Basic lemmas in polynomial-time infeasible-interior-point methods for linear programs / 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: Computational experience with a primal-dual interior point method 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: On the Implementation of a Primal-Dual Interior Point Method / 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: Interior path following primal-dual algorithms. I: Linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4791754 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dynamic large-update primal‐dual interior-point method for linear optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Self-regular functions and new search directions for linear and semidefinite optimization / 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 Infeasible-Interior-Point Method for Linear Complementarity Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4250861 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interior point methods of mathematical programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate Farkas lemmas and stopping rules for iterative infeasible-point algorithms for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Infeasible Path-Following Method for Monotone Complementarity Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An infeasible-interior-point potential-reduction algorithm for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An infeasible-interior-point algorithm for linear complementarity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A superquadratic infeasible-interior-point method for linear complementarity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4382667 / 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: Solving large-scale linear programs by interior-point methods under the Matlab<sup>∗</sup>Environment<sup>†</sup> / rank
 
Normal rank
Property / cites work
 
Property / cites work: User'S guide To Lipsol linear-programming interior point solvers V0.4 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10589-005-3064-1 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 02:17, 19 December 2024

scientific article
Language Label Description Also known as
English
The complexity of self-regular proximity based infeasible IPMs
scientific article

    Statements

    The complexity of self-regular proximity based infeasible IPMs (English)
    0 references
    0 references
    0 references
    0 references
    28 September 2006
    0 references
    linear optimization
    0 references
    infeasible interior point method
    0 references
    self-regular proximity function
    0 references
    polynomial complexity
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers