A new kind of simple kennel function yielding good iteration bounds for primal-dual interior-point methods (Q631897): 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.1016/j.cam.2010.12.012 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2084309945 / 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 large-update interior point algorithm for \(P_*(\kappa )\) linear complementarity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5453751 / 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: Primal-dual interior-point algorithms for second-order cone optimization based on a new parametric kernel function / rank
 
Normal rank
Property / cites work
 
Property / cites work: A matrix-splitting method for symmetric affine second-order cone complementarity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global convergence enhancement of classical linesearch interior point methods for MCPs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial-time algorithm for linear optimization based on a new class of kernel functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Engineering and Economic Applications of Complementarity Problems / 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: New complexity analysis of the primal-dual Newton method for linear optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2773659 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new class of polynomial primal-dual methods for linear and semidefinite optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primal-Dual Interior-Point Methods for Second-Order Conic Optimization Based on Self-Regular Proximities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast convergence of the simplified largest step path following algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interior-point methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primal-dual target-following algorithms for linear programming / 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: 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: Q4347846 / 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: Q4791754 / 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: 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 polynomial-time algorithm for linear optimization based on a new simple kernel function / rank
 
Normal rank
Property / cites work
 
Property / cites work: A class of large-update and small-update primal-dual interior-point algorithms for linear optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new proximity function generating the best known iteration bounds for both large-update and small-update interior-point methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primal-dual interior-point algorithms for second-order cone optimization based on kernel functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3738934 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4206561 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the finite convergence of interior-point algorithms for linear 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: Primal-dual interior-point algorithms with dynamic step-size based on kernel functions for linear programming / rank
 
Normal rank

Latest revision as of 21:39, 3 July 2024

scientific article
Language Label Description Also known as
English
A new kind of simple kennel function yielding good iteration bounds for primal-dual interior-point methods
scientific article

    Statements

    A new kind of simple kennel function yielding good iteration bounds for primal-dual interior-point methods (English)
    0 references
    0 references
    0 references
    14 March 2011
    0 references
    0 references
    0 references
    0 references
    0 references
    kernel function
    0 references
    large-update methods
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references