A Lagrangian-DNN relaxation: a fast method for computing tight lower bounds for a class of quadratic optimization problems (Q263189): Difference between revisions

From MaRDI portal
Changed an Item
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: SDPT3 / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Biq Mac / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: BiqMac / 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/s10107-015-0874-5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2083411653 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Quadratically Constrained Quadratic Optimization Model for Completely Positive Cone Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2928409 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extension of completely positive cone relaxation to moment cone relaxation for polynomial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3151174 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternating direction augmented Lagrangian methods for semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: CSDP, A C library for semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Adaptive Linear Approximation Algorithm for Copositive Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the copositive representation of binary and continuous nonconvex quadratic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimizing a polyhedral-semidefinite relaxation of completely positive programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The direct extension of ADMM for multi-block convex minimization problems is not necessarily convergent / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation of the Stability Number of a Graph via Copositive Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Erratum to: ``On the set-semidefinite representation of nonconvex quadratic programs over arbitrary feasible sets'' / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3497912 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cone-valued maps in optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hankel Matrix Rank Minimization with Applications to System Identification and Realization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rigorous Error Bounds for the Optimal Value in Semidefinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dual algorithm for the solution of nonlinear variational problems via finite element approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Doubly Positive Semidefinite Programming Relaxations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4144736 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3845569 / 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: Q4324980 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Copositive and semidefinite relaxations of the quadratic assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3747197 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations / 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: SDPT3 — A Matlab software package for semidefinite programming, Version 1.3 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3236239 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Convergent 3-Block SemiProximal Alternating Direction Method of Multipliers for Conic Programming with 4-Type Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Newton-CG Augmented Lagrangian Method for Semidefinite Programming / rank
 
Normal rank

Latest revision as of 16:55, 11 July 2024

scientific article
Language Label Description Also known as
English
A Lagrangian-DNN relaxation: a fast method for computing tight lower bounds for a class of quadratic optimization problems
scientific article

    Statements

    A Lagrangian-DNN relaxation: a fast method for computing tight lower bounds for a class of quadratic optimization problems (English)
    0 references
    0 references
    0 references
    0 references
    4 April 2016
    0 references
    linearly constrained quadratic optimization problems with complementarity constraints
    0 references
    Lagrangian-conic relaxation
    0 references
    bisection method
    0 references
    iterative solver
    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
    0 references

    Identifiers