Globally solving extended trust region subproblems with two intersecting cuts (Q2228371): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Created claim: Wikidata QID (P12): Q127246017, #quickstatements; #temporary_batch_1721940658196
 
(7 intermediate revisions by 6 users not shown)
Property / author
 
Property / author: Zhi-bin Deng / rank
Normal rank
 
Property / author
 
Property / author: Zhi-bin Deng / 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.1007/s11590-019-01484-z / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2975287029 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821526 / 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: The trust region subproblem with non-intersecting linear constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conic approximation to nonconvex quadratic programming with convex quadratic constraints / 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: Exact computable representation of some second-order cone constrained quadratic programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exactness conditions for an SDP relaxation of the extended trust region problem / 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: Tightness of a New and Enhanced Semidefinite Relaxation for MIMO Detection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local Minimizers of Quadratic Functions on Euclidean Balls and Spheres / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some NP-complete problems in quadratic and nonlinear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trust region subproblem with an additional linear inequality constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Cones of Nonnegative Quadratic Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-time algorithm for the trust region subproblem based on hidden convexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Results on Quadratic Minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recent advances in trust region algorithms / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q127246017 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 21:54, 25 July 2024

scientific article
Language Label Description Also known as
English
Globally solving extended trust region subproblems with two intersecting cuts
scientific article

    Statements

    Globally solving extended trust region subproblems with two intersecting cuts (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    17 February 2021
    0 references
    extended trust region subproblem
    0 references
    intersecting cuts
    0 references
    semidefinite programming relaxation
    0 references
    second-order cone constraints
    0 references

    Identifiers