A corrector-predictor interior-point method with new search direction for linear optimization (Q2201317): 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/s10100-019-00622-3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2946830141 / 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: 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: Q4003375 / 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: Q3428838 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2997579 / 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: A Mizuno-Todd-Ye type predictor-corrector algorithm for sufficient linear complementarity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational aspects of simplex and MBU-simplex algorithms using different anti-cycling pivot rules / 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: A polynomial path-following interior point algorithm for general linear complementarity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2867373 / 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: A corrector-predictor path-following method for convex quadratic symmetric cone optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A corrector–predictor path-following method for second-order cone optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: An infeasible interior point method for the monotone SDLCP based on a transformation of the central path / 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: Unified Analysis of Kernel-Based Interior-Point Methods for $P_*(\kappa)$-Linear Complementarity Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A full Nesterov–Todd step infeasible-interior-point algorithm for Cartesian<i>P</i><sub>*</sub>(κ) horizontal linear complementarity problems over symmetric cones / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4206561 / 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: On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming / 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: The Mizuno-Todd-Ye algorithm in a larger neighborhood of the central path / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interior Point Methods for Sufficient Horizontal LCP in a Wide Neighborhood of the Central Path with Best Known 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: Q4339096 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3780013 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3738934 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3348700 / 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: Weighted-path-following interior-point algorithm to monotone mixed linear complementarity problem / 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: Q4347848 / rank
 
Normal rank

Latest revision as of 17:00, 23 July 2024

scientific article
Language Label Description Also known as
English
A corrector-predictor interior-point method with new search direction for linear optimization
scientific article

    Statements

    A corrector-predictor interior-point method with new search direction for linear optimization (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    29 September 2020
    0 references
    0 references
    0 references
    0 references
    0 references
    linear optimization
    0 references
    corrector-predictor methods
    0 references
    new search directions
    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
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references