A DC programming approach for solving the symmetric eigenvalue complementarity problem (Q429495): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: LOQO / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: MatrixMarket / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: MINOS / 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/s10589-010-9388-5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2057932996 / 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: Properties of two DC algorithms in quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unconstrained Variational Principles for Eigenvalues of Real Symmetric Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Globally and Rapidly Convergent Algorithms for Symmetric Eigenproblems / rank
 
Normal rank
Property / cites work
 
Property / cites work: NP-completeness of the linear complementarity problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Numerical resolution of cone-constrained eigenvalue problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2760098 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Eigenvalue computation in the 20th century / rank
 
Normal rank
Property / cites work
 
Property / cites work: Collusive game solutions via optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3998992 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The eigenvalue complementarity problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the solution of the symmetric eigenvalue complementarity problem by the spectral projected gradient algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the asymmetric eigenvalue complementarity problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization-based stability analysis of structures under unilateral constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Numerical methods for general and structured eigenvalue problems. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4551020 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A continuous approch for globally solving linearly constrained quadratic / 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: Computing eigenelements of real symmetric matrices via optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4039868 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4150621 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combined SVM-based feature selection and classification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4348515 / 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: The symmetric eigenvalue complementarity problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2756976 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Signal and image approximation with level-set constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Eigenvalue analysis of equilibrium processes defined by linear complementarity conditions / 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: DC Programming Approach for a Class of Nonconvex Programs Involving l 0 Norm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4358702 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Image Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the finiteness of the cone spectrum of certain linear transformations on Euclidean Jordan algebras / rank
 
Normal rank

Latest revision as of 09:34, 5 July 2024

scientific article
Language Label Description Also known as
English
A DC programming approach for solving the symmetric eigenvalue complementarity problem
scientific article

    Statements

    A DC programming approach for solving the symmetric eigenvalue complementarity problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    19 June 2012
    0 references
    0 references
    DC programming
    0 references
    DCA
    0 references
    eigenvalue complementarity problem
    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