Polynomial interior-point algorithm for \(P_\ast(\kappa)\) horizontal linear complementarity problems (Q2376364): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 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/s11075-012-9628-0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2001532723 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unified approach to interior point algorithms for linear complementary problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(P_ *\)-matrices are just sufficient / 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 New Infinity-Norm Path Following Algorithm for Linear 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: Q4339096 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The largest step path following algorithm for monotone linear complementarity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equivaence between different formulations of the linear complementarity promblem / 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: Self-regular functions and new search directions for linear and semidefinite optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new full-Newton step \(O(n)\) infeasible interior-point algorithm for semidefinite optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A full-Newton step \(O(n)\) infeasible-interior-point algorithm for linear complementarity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved infeasible-interior-point algorithm for linear complementarity problerns / 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: The convergence of a one-step smoothing Newton method for \(P_0\)-NCP based on a new smoothing NCP-function / 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: Infeasible-interior-point paths for sufficient linear complementarity problems and their analyticity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Corrector-predictor methods for sufficient linear complementarity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial interior-point algorithms for \(P_*(\kappa )\) horizontal linear complementarity problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4526886 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A smoothing Gauss-Newton method for the generalized HLCP / 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 Predictor-Corrector Algorithm for Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An \(O(nL)\) infeasible-interior-point algorithm for LCP with quadratic convergence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3415802 / 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: A new full Nesterov-Todd step primal-dual path-following interior-point algorithm for symmetric optimization / rank
 
Normal rank

Latest revision as of 14:08, 6 July 2024

scientific article
Language Label Description Also known as
English
Polynomial interior-point algorithm for \(P_\ast(\kappa)\) horizontal linear complementarity problems
scientific article

    Statements

    Polynomial interior-point algorithm for \(P_\ast(\kappa)\) horizontal linear complementarity problems (English)
    0 references
    0 references
    21 June 2013
    0 references
    horizontal linear complementarity problem
    0 references
    feasible interior-point method
    0 references
    central path
    0 references
    0 references
    0 references
    0 references

    Identifiers