A kernel function based interior-point methods for solving \(P_{*}(\kappa )\)-linear complementarity problem (Q606335): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10114-010-7529-5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2030548196 / 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: Q4339096 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5691079 / 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 unified approach to interior point algorithms for linear complementarity problems: A summary / rank
 
Normal rank
Property / cites work
 
Property / cites work: An infeasible-interior-point predictor-corrector algorithm for the \(P_ *\)-geometric LCP / 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: Self-regular functions and new search directions for linear and semidefinite 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 self-adjusting interior point algorithm for linear complementarity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An interior-point algorithm for linear optimization based on a new kernel function / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new kernel function yielding the best known iteration bounds for primal-dual interior-point algorithms / 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: Q5453751 / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(P_ *\)-matrices are just sufficient / rank
 
Normal rank
Property / cites work
 
Property / cites work: An interior point method for linear programming based on a class of Kernel functions / 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 new class of polynomial primal-dual methods for linear and semidefinite optimization / rank
 
Normal rank

Latest revision as of 11:13, 3 July 2024

scientific article
Language Label Description Also known as
English
A kernel function based interior-point methods for solving \(P_{*}(\kappa )\)-linear complementarity problem
scientific article

    Statements

    A kernel function based interior-point methods for solving \(P_{*}(\kappa )\)-linear complementarity problem (English)
    0 references
    0 references
    0 references
    17 November 2010
    0 references
    large and small update methods
    0 references
    polynomial complexity
    0 references
    0 references
    0 references
    0 references

    Identifiers