A modified homogeneous potential reduction algorithm for solving the monotone semidefinite linear complementarity problem (Q331977): Difference between revisions

From MaRDI portal
Changed an Item
Import241208061232 (talk | contribs)
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s11590-015-0940-1 / rank
Normal rank
 
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/s11590-015-0940-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1412000869 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simplified homogeneous and self-dual linear programming algorithm and its implementation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applications of semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A computational study of the homogeneous algorithm for large-scale convex optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a homogeneous algorithm for the monotone complementarity problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: SDPLIB 1.2, a library of semidefinite programming test problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sdpha: a Matlab implementation of homogeneous interior-point algorithms for semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3095902 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-time algorithms for linear programming based only on primal scaling and projected gradients of a potential function / rank
 
Normal rank
Property / cites work
 
Property / cites work: A relaxed version of Karmarkar's method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Search directions in the SDP and the monotone SDLCP: Generalization and inexact computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Implementations for Nonsmooth Convex Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Interior-Point Method for Semidefinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An \(O(\sqrt n L)\) iteration potential reduction algorithm for linear complementarity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interior-Point Methods for the Monotone Semidefinite Linear Complementarity Problem in Symmetric Matrices / 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: Infeasible-Interior-Point Primal-Dual Potential-Reduction Algorithms for Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomiality of primal-dual algorithms for semidefinite linear complementarity problems based on the Kojima-Shindoh-Hara family of directions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primal--Dual Path-Following Algorithms for Semidefinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational experience with a modified potential reduction algorithm for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A potential reduction algorithm for an extended SDP problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On homogeneous interrior-point algorithms for semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Superlinearly Convergent Primal-Dual Infeasible-Interior-Point Algorithm for Semidefinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the calculation of step-lengths in interior-point methods for semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3804467 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Centered Projective Algorithm for Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Potential-reduction methods in mathematical programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Implementation and Usage of SDPT3 – A Matlab Software Package for Semidefinite-Quadratic-Linear Programming, Version 4.0 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving semidefinite-quadratic-linear programs using SDPT3 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S11590-015-0940-1 / rank
 
Normal rank

Latest revision as of 14:34, 9 December 2024

scientific article
Language Label Description Also known as
English
A modified homogeneous potential reduction algorithm for solving the monotone semidefinite linear complementarity problem
scientific article

    Statements

    A modified homogeneous potential reduction algorithm for solving the monotone semidefinite linear complementarity problem (English)
    0 references
    0 references
    0 references
    27 October 2016
    0 references
    interior point method
    0 references
    semidefinite programming
    0 references
    semidefinite linear complementarity problem
    0 references
    homogenous and self-dual method
    0 references
    potential reduction function
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers