On solving nonconvex optimization problems by reducing the duality gap (Q2494287): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
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/s10898-004-1947-9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2026753148 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A relaxation method for nonconvex quadratically constrained quadratic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global minimization by reducing the duality gap / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lagrange Multipliers and Nonconvex Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Separable Nonconvex Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4251073 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nondifferentiable optimization and polynomial problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lagrangian bounds in multiextremal polynomial and discrete optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Duality bound method for the general quadratic programming problem with quadratic constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence of duality bound method in partly convex programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4498100 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex analysis and global optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4495147 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 16:27, 24 June 2024

scientific article
Language Label Description Also known as
English
On solving nonconvex optimization problems by reducing the duality gap
scientific article

    Statements

    On solving nonconvex optimization problems by reducing the duality gap (English)
    0 references
    0 references
    26 June 2006
    0 references
    branch and bound algorithm
    0 references
    convergence conditions
    0 references
    dual bound
    0 references
    Lagrangian bound
    0 references
    partly convex programming
    0 references
    partly linear optimization
    0 references

    Identifiers