An SOCP relaxation based branch-and-bound method for generalized trust-region subproblem (Q2031320): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
(6 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Xiao-Ying Tang / rank
Normal rank
 
Property / author
 
Property / author: Xiao-Ying Tang / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: SeDuMi / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: CVX / 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.3934/jimo.2019104 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2978053374 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong Duality for the CDT Subproblem: A Necessary and Sufficient Condition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Feasibility testing for systems of real quadratic equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and bound algorithm for nonconvex quadratic optimization with ball and linear constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hidden conic quadratic representation of some nonconvex quadratic optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial Solvability of Variants of the Trust-Region Subproblem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Note on Polynomial Solvability of the CDT Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Narrowing the difficulty gap for the Celis-Dennis-Tapia problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extended trust-region problems with one or two balls: exact copositive and Lagrangian relaxations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Second-Order-Cone Constraints for Extended Trust-Region Subproblems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3681854 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Second-Order Cone Based Approach for Solving the Trust-Region Subproblem and Its Variants / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simultaneous Diagonalization of Matrices and Its Applications in Quadratically Constrained Quadratic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trust-region problems with linear inequality constraints: exact SDP relaxation, global optimality and robust optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Second order cone programming relaxation of nonconvex quadratic optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An eigenvalue decomposition based branch-and-bound algorithm for nonconvex quadratic programming problems with convex quadratic constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sensitive-eigenvector based global algorithm for quadratically constrained quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning / rank
 
Normal rank
Property / cites work
 
Property / cites work: A trust region method for nonsmooth convex optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: An adaptive trust region algorithm for large-residual nonsmooth least squares problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Cones of Nonnegative Quadratic Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: An intuitionistic fuzzy set based \(S^3\)VM model for binary classification with mislabeled information / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conic approximation to quadratic optimization with linear complementarity constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simultaneous diagonalization based SOCP relaxation for convex quadratic programs with linear complementarity constraints / rank
 
Normal rank

Revision as of 22:15, 25 July 2024

scientific article
Language Label Description Also known as
English
An SOCP relaxation based branch-and-bound method for generalized trust-region subproblem
scientific article

    Statements

    An SOCP relaxation based branch-and-bound method for generalized trust-region subproblem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    9 June 2021
    0 references
    second-order cone programming relaxation
    0 references
    semidefinite programming relaxation
    0 references
    branch-and-bound algorithm
    0 references
    trust-region problem
    0 references
    simultaneous diagonalization
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references