An augmented Lagrangian method for binary quadratic programming based on a class of continuous functions (Q279813): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s11590-015-0873-8 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2052563056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for nonlinear optimization problems with binary variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: A projected gradient algorithm for solving the maxcut SDP relaxation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rank-Two Relaxation Heuristics for MAX-CUT and Other Binary Quadratic Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Feasible direction algorithm for solving the SDP relaxations of quadratic {−1, 1} programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4524243 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex Relaxations of (0, 1)-Quadratic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A global continuation algorithm for solving binary quadratic programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A continuation approach for solving binary quadratic program based on a class of NCP-functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primal-Dual Interior-Point Methods for Semidefinite Programming: Convergence Rates, Stability and Numerical Results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-Point Step Size Gradient Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3690580 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Spectral Bundle Method for Semidefinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lagrangian smoothing heuristics for Max-cut / rank
 
Normal rank

Latest revision as of 22:02, 11 July 2024

scientific article
Language Label Description Also known as
English
An augmented Lagrangian method for binary quadratic programming based on a class of continuous functions
scientific article

    Statements

    An augmented Lagrangian method for binary quadratic programming based on a class of continuous functions (English)
    0 references
    0 references
    0 references
    29 April 2016
    0 references
    binary quadratic programming
    0 references
    augmented Lagrangian method
    0 references
    max-cut
    0 references
    Barzilai-Borwein-type method
    0 references
    continuous functions
    0 references
    0 references
    0 references

    Identifiers