A reformulation-convexification approach for solving nonconvex quadratic programming problems (Q1905961): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Jointly Constrained Biconvex Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global optimization of a quadratic function subject to a bounded mixed integer constraint set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3030587 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4942383 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Lagrangian Relaxation Method for Solving Integer Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primal-relaxed dual global optimization approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3359644 / 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: An analytical approach to global optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Indefinite Quadratic Programming Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence of relaxation algorithms by averaging / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Method for Solving the Indefinite Quadratic Programming Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for indefinite quadratic programming with convex constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global optimization algorithms for linearly constrained indefinite quadratic problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global minimization of indefinite quadratic problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constrained global optimization: algorithms and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quadratic programming with one negative eigenvalue is NP-hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3491318 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A method for solving maximum-problems with a nonconcave quadratic objective function / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new reformulation-linearization technique for bilinear programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique / rank
 
Normal rank
Property / cites work
 
Property / cites work: A primal-dual conjugate subgradient algorithm for specially structured linear and convex programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global minimization of a difference of two convex functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for indefinite quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: New properties and computational improvement of the GOP algorithm for problems with quadratic objective functions and constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonlinear Programming: Counterexamples to Two Global Optimization Algorithms / rank
 
Normal rank

Latest revision as of 08:19, 24 May 2024

scientific article
Language Label Description Also known as
English
A reformulation-convexification approach for solving nonconvex quadratic programming problems
scientific article

    Statements

    A reformulation-convexification approach for solving nonconvex quadratic programming problems (English)
    0 references
    0 references
    0 references
    8 February 1996
    0 references
    reformulation-linearization/convexification technique
    0 references
    outer-approximations
    0 references
    tight linear programming relaxations
    0 references
    linearly constrained nonconvex quadratic programming
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers