Properties of two DC algorithms in quadratic programming (Q628748): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3968042 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A finite algorithm for solving general quadratic problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On standard quadratic optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition methods for solving nonconvex quadratic programs via branch and bound / rank
 
Normal rank
Property / cites work
 
Property / cites work: Une caractérisation complete des minima locaux en programmation quadratique / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4003375 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Quadratic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3905599 / 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: A combined d.c. optimization--ellipsoidal branch-and-bound algorithm for solving nonconvex quadratic programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and bound method via d. c. optimization algorithms and ellipsoidal technique for box constrained nonconvex quadratic problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient algorithm for globally minimizing a quadratic function under convex quadratic constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large-Scale Molecular Optimization from Distance Matrices by a D.C. Optimization Approach / 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: Locally unique solutions of quadratic programs, linear and nonlinear complementarity problems / 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: Combining DCA (DC Algorithms) and interior point techniques for large-scale nonconvex quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient combined DCA and B\&B using DC/SDP relaxation for globally solving binary quadratic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: ARPACK Users' Guide / rank
 
Normal rank

Latest revision as of 21:27, 3 July 2024

scientific article
Language Label Description Also known as
English
Properties of two DC algorithms in quadratic programming
scientific article

    Statements

    Properties of two DC algorithms in quadratic programming (English)
    0 references
    0 references
    0 references
    0 references
    14 March 2011
    0 references
    0 references
    KKT point
    0 references
    local solution
    0 references
    DCA sequence
    0 references
    convergence
    0 references
    boundedness
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references