A generalized direction in interior point method for monotone linear complementarity problems (Q1733321): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q5309480 / 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: Polynomial interior-point algorithm for \(P_\ast(\kappa)\) horizontal linear complementarity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new full-Newton step \(O(n)\) infeasible interior-point algorithm for \(P_\ast(\kappa)\)-horizontal linear complementarity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An infeasible interior-point method with improved centering steps for monotone linear complementarity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the<i>P<sub>*</sub>(κ)</i>horizontal linear complementarity problems over Cartesian product of symmetric cones / rank
 
Normal rank
Property / cites work
 
Property / cites work: An infeasible full-NT step IPM for horizontal linear complementarity problem over Cartesian product of symmetric cones / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Corrector-Predictor Interior-Point Algorithm for <i>P</i><sub>∗</sub>(<i>κ</i>)-HLCPs Over Cartesian Product of Symmetric Cones / 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: Finite-Dimensional Variational Inequalities and Complementarity Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smoothing methods for nonlinear complementarity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4362984 / 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 Smoothing Method for Sparse Optimization over Polyhedral Sets / 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: An Improved and Simplified Full-Newton Step $O(n)$ Infeasible Interior-Point Method for Linear Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interior Point Methods for Linear Optimization / 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: New complexity analysis of a full-Newton step feasible interior-point algorithm for \(P_\ast(\kappa)\)-LCP / rank
 
Normal rank

Latest revision as of 20:02, 18 July 2024

scientific article
Language Label Description Also known as
English
A generalized direction in interior point method for monotone linear complementarity problems
scientific article

    Statements

    A generalized direction in interior point method for monotone linear complementarity problems (English)
    0 references
    0 references
    0 references
    0 references
    21 March 2019
    0 references
    concave functions
    0 references
    interior-point methods
    0 references
    linear programming
    0 references
    linear complementarity problems
    0 references
    polynomial time complexity
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers