New method for determining search directions for interior-point algorithms in linear optimization (Q723503): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
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/s11590-017-1171-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2736530414 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new primal-dual path-following method for convex quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity analysis and numerical implementation of a short-step primal-dual algorithm for linear complementarity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An <i>O</i>$(\sqrtn L)$ Iteration Primal-dual Path-following Method, Based on Wide Neighborhoods and Large Updates, for Monotone LCP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4347846 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial interior-point algorithm for \(P_\ast(\kappa)\) horizontal linear complementarity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Efficient Large-Update Primal-Dual Interior-Point Method Based on a Finite Barrier / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3844775 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5309527 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3415802 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity analysis of a full-{N}ewton step interior-point method for linear optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pivot versus interior point methods: Pros and cons / rank
 
Normal rank
Property / cites work
 
Property / cites work: EP theorem for dual linear complementarity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2867373 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial path-following interior point algorithm for general linear complementarity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The theory of linear programming:skew symmetric self-dual problems and the central path<sup>*</sup> / 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: A predictor-corrector interior-point algorithm for \(P_\ast (\kappa )\)-horizontal linear complementarity problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some generalizations of the criss-cross method for the linear complementarity problem of oriented matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unified approach to interior point algorithms for linear complementarity problems: A summary / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Class of Large Neighborhood Path-Following Interior Point Algorithms for Semidefinite Optimization with $O(\sqrt{n}\log\frac{\mathrm{Tr}(X^0S^0)}{\epsilon})$ Iteration Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial interior-point algorithm for monotone linear complementarity problems / 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: Q4324980 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4791754 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity analysis of an interior-point algorithm for linear optimization based on a new proximity function / rank
 
Normal rank
Property / cites work
 
Property / cites work: A superlinearly convergent predictor-corrector method for degenerate LCP in a wide neighborhood of the central path with \(O(\sqrt nL)\)-iteration complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Predictor-corrector algorithm for solving \(P_ *(\kappa)\)-matrix LCP from arbitrary positive starting points / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Large-Step Infeasible-Interior-Point Method for the P*-Matrix LCP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4339096 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3738934 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A convergent criss-cross method / rank
 
Normal rank
Property / cites work
 
Property / cites work: An easy way to teach interior-point methods. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A NEW POLYNOMIAL INTERIOR-POINT ALGORITHM FOR THE MONOTONE LINEAR COMPLEMENTARITY PROBLEM OVER SYMMETRIC CONES WITH FULL NT-STEPS / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new primal-dual path-following interior-point algorithm for semidefinite optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A primal-dual interior-point algorithm for second-order cone optimization with full Nesterov-Todd step / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new full Nesterov-Todd step primal-dual path-following interior-point algorithm for symmetric optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5691079 / 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: A full-Newton step interior-point algorithm based on modified Newton direction / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new primal-dual path-following interior-point algorithm for linearly constrained convex optimization / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 05:17, 16 July 2024

scientific article
Language Label Description Also known as
English
New method for determining search directions for interior-point algorithms in linear optimization
scientific article

    Statements

    New method for determining search directions for interior-point algorithms in linear optimization (English)
    0 references
    0 references
    0 references
    31 July 2018
    0 references
    interior-point algorithm
    0 references
    linear optimization
    0 references
    algebraic equivalent transformation
    0 references
    search direction
    0 references
    Newton's method
    0 references
    polynomial complexity
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers