Lagrangian decomposition of block-separable mixed-integer all-quadratic programs (Q1771303): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(8 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: LaGO / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: EISPACK / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: NOA / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: GLOPT / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: ARPACK / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: MINLPLib / 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-003-0500-9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1989771738 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A reformulation-linearization technique for solving discrete and continuous nonconvex problems / 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: Q5688505 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lift-and-project cutting plane algorithm for mixed 0-1 programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2712822 / rank
 
Normal rank
Property / cites work
 
Property / cites work: MINLPLib—A Collection of Test Models for Mixed-Integer Nonlinear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Decomposition Method for Quadratic Zero-One Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4023809 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition Principle for Linear Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Control of a Markov Production System / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Numerical Solution of Heat Conduction Problems in Two and Three Space Variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dual bounding procedures lead to convergent branch-and-bound algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioning mathematical programs for parallel solution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bilinear programming and structured stochastic games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exploiting sparsity in primal-dual interior-point methods for semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lagrangean decomposition: A model yielding stronger lagrangean bounds / 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: Q4273942 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introduction to global optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quadratically constrained quadratic programming: Some applications and a method for solution / 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: Proximity control in bundle methods for convex nondifferentiable minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discretization and localization in successive convex relaxation methods for nonconvex quadratic optimization. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A geometric study of dual gaps, with applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4517108 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dual bounds and optimality cuts for all-quadratic programs with convex constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global Optimization and Constraint Satisfaction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4428719 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A recipe for semidefinite relaxation for \((0,1)\)-quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A semidefinite framework for trust region subproblems with applications to large scale minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition methods in stochastic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Indefinite Trust Region Subproblems and Nonsymmetric Eigenvalue Perturbations / 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: A Cutting Plane Approach for Chance Constrained Linear Programs / rank
 
Normal rank

Latest revision as of 10:10, 10 June 2024

scientific article
Language Label Description Also known as
English
Lagrangian decomposition of block-separable mixed-integer all-quadratic programs
scientific article

    Statements

    Lagrangian decomposition of block-separable mixed-integer all-quadratic programs (English)
    0 references
    0 references
    19 April 2005
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    semidefinite programming
    0 references
    quadratic programming
    0 references
    combinatorial optimization
    0 references
    non-convex programming
    0 references
    decomposition
    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