On solving linear complementarity problems by DC programming and DCA (Q409266): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Iterative methods for linear complementarity problems with upperbounds on primary variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Smoothing Methods for the <i>P</i><sub>0</sub> Matrix Linear Complementarity Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4003375 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational complexity of LCPs associated with positive definite symmetric matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution of a general linear complementarity problem using smooth optimization and its application to bilinear programming and LCP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handbook of test problems in local and global optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the solution of NP-hard linear complementarity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the resolution of monotone complementarity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving a class of linearly constrained indefinite quadratic problems by DC algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4039868 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4308909 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global Optimization Approach to the Linear Complementarity Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quadratic programming with one negative eigenvalue is NP-hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: A class of linear complementarity problems solvable in polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex analysis approach to d. c. programming: Theory, algorithms and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5434306 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete tomography by convex--concave regularization and D.C. programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumeration approach for linear complementarity problems based on a reformulation-linearization technique / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Globally and Locally Superlinearly Convergent Non--Interior-Point Algorithm for P<sub>0</sub>LCPs / rank
 
Normal rank

Latest revision as of 02:17, 5 July 2024

scientific article
Language Label Description Also known as
English
On solving linear complementarity problems by DC programming and DCA
scientific article

    Statements

    On solving linear complementarity problems by DC programming and DCA (English)
    0 references
    0 references
    0 references
    12 April 2012
    0 references
    0 references
    LCP
    0 references
    DC programming
    0 references
    DCA
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references