New global algorithms for quadratic programming with a few negative eigenvalues based on alternative direction method and convex relaxation

No abstract is available for this paper.

• Publication year

  2018

• Venue

  Mathematical Programming Computation

• Publication date

  2018-08-22

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1007/s12532-018-0142-9
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• A nonlinear semidefinite optimization relaxation for the worst-case linear optimization under uncertainties

  2015cited by this paper
• Recent Advances in DC Programming and DCA

  2013influential reference
• Optimality conditions and finite convergence of Lasserre’s hierarchy

  2012cited by this paper
• Globally solving nonconvex quadratic programming problems via completely positive programming

  2011cited by this paper
• Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations

  2011cited by this paper
• An FPTAS for minimizing the product of two non-negative linear cost functions

  2011cited by this paper
• Convex relaxations of non-convex mixed integer quadratically constrained programs: extended formulations

  2010cited by this paper
• Solving a class of low rank d.c. programs via a branch and bound approach: A computational experience

  2010cited by this paper
• Optimal Spectrum Sharing in MIMO Cognitive Radio Networks via Semidefinite Programming

  2010cited by this paper
• A branch and reduce approach for solving a class of low rank d.c. programs

  2009cited by this paper
• Globally solving box-constrained nonconvex quadratic programs with semidefinite-based finite branch-and-bound

  2009cited by this paper
• A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations

  2008cited by this paper
• Biconvex sets and optimization with biconvex functions: a survey and extensions

  2007cited by this paper
• A polyhedral study of nonconvex quadratic programs with box constraints

  2005cited by this paper
• A branch-and-cut algorithm for nonconvex quadratic programs with box constraints

  2005cited by this paper
• Convex Optimization

  2004cited by this paper
• A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0-1 Programming

  2003cited by this paper
• Exact Solutions of Some Nonconvex Quadratic Optimization Problems via SDP and SOCP Relaxations

  2003cited by this paper
• Numerical Methods for Large-Scale Non-Convex Quadratic Programming

  2002cited by this paper
• A Finite Algorithm for a Particular D.C. Quadratic Programming Problem

  2002cited by this paper
• Global Optimization with Polynomials and the Problem of Moments

  2000cited by this paper
• Discretization and localization in successive convex relaxation methods for nonconvex quadratic optimization

  2000cited by this paper
• Quadratic maximization and semidefinite relaxation

  2000cited by this paper
• Handbook of Semidefinite Programming

  2000cited by this paper
• An efficient algorithm for globally minimizing a quadratic function under convex quadratic constraints

  2000cited by this paper
• DC Programming: Overview

  1999cited by this paper
• Cones of Matrices and Successive Convex Relaxations of Nonconvex Sets

  1999cited by this paper
• A Branch and Bound Method via d.c. Optimization Algorithms and Ellipsoidal Technique for Box Constrained Nonconvex Quadratic Problems

  1998cited by this paper
• On the complexity of approximating a KKT point of quadratic programming

  1998cited by this paper
• Solving a Class of Linearly Constrained Indefinite Quadratic Problems by D.C. Algorithms

  1997cited by this paper
• BARON: A general purpose global optimization software package

  1996cited by this paper
• Necessary Conditions for Optimality

  1996cited by this paper
• NP-hardness of linear multiplicative programming and related problems

  1996cited by this paper
• A reformulation-convexification approach for solving nonconvex quadratic programming problems

  1995cited by this paper
• Handbook of global optimization

  1995cited by this paper
• Quadratic Optimization

  1995influential reference
• New properties and computational improvement of the GOP algorithm for problems with quadratic objective functions and constraints

  1993cited by this paper
• Approximation algorithms for indefinite quadratic programming

  1992cited by this paper
• GLOBAL OPTIMIZATION ALGORITHMS FOR LINEARLY CONSTRAINED INDEFINITE QUADRATIC PROBLEMS

  1991cited by this paper
• Quadratic programming with one negative eigenvalue is NP-hard

  1991influential reference
• Cones of Matrices and Set-Functions and 0-1 Optimization

  1991cited by this paper
• Computational aspects of a branch and bound algorithm for quadratic zero-one programming

  1990cited by this paper
• A Hierarchy of Relaxations Between the Continuous and Convex Hull Representations for Zero-One Programming Problems

  1990cited by this paper
• A hierarchy of relaxation between the continuous and convex hull representations

  1990cited by this paper
• Checking local optimality in constrained quadratic programming is NP-hard

  1988cited by this paper
• Necessary conditions for ε-optimality

  1982cited by this paper
• Nonlinear Optimization by Successive Linear Programming

  1982cited by this paper
• A cutting plane algorithm for solving bilinear programs

  1976cited by this paper

• A global optimization approach utilizing convex relaxation for linear multiplicative programming problems

  2026cites this paper
• A Frank-Wolfe-based primal heuristic for quadratic mixed-integer optimization

  2025cites this paper
• A novel global algorithm for optimal portfolio selection with maximum relative marginal risk via SCO method and SOCP relaxation

  2025influential citation
• A new branch-and-bound algorithm for generalized affine multiplicative programming

  2025cites this paper
• Quadratic Optimization Through the Lens of Adjustable Robust Optimization

  2025cites this paper
• New biconvex optimization for planning of battery energy storage systems

  2025cites this paper
• A New branch-and-cut algorithm for linear sum-of-ratios problem based on SLO method and LO relaxation

  2024cites this paper
• Improved Branch and Bound algorithm and an interpolation-based search algorithm for quadratic minimization with one negative eigenvalue

  2024influential citation
• Active RIS-Empowered Signal Cancellation Attacks

  2024influential citation
• A new branch and bound method for solving linear multiplicative programming problems

  2024cites this paper
• An efficient global optimization algorithm for a class of linear multiplicative problems based on convex relaxation

  2024cites this paper
• A Global Solution Algorithm for AC Optimal Power Flow through Linear Constrained Quadratic Programming

  2024cites this paper
• A novel branch‐and‐bound algorithm for solving linear multiplicative programming problems

  2024cites this paper
• A novel global algorithm for solving linear multiplicative problem by integrating linear combination rule and branch-and-bound framework

  2024cites this paper
• A criterion space algorithm for solving linear multiplicative programming problems

  2023cites this paper
• Flag Aggregator: Scalable Distributed Training under Failures and Augmented Losses using Convex Optimization

  2023cites this paper
• Globally minimizing a class of linear multiplicative forms via simplicial branch-and-bound

  2023cites this paper
• An effective global algorithm for worst-case linear optimization under polyhedral uncertainty

  2023influential citation
• Effective algorithms for separable nonconvex quadratic programming with one quadratic and box constraints

  2023cites this paper
• A Variance Reducing Stochastic Proximal Method with Acceleration Techniques

  2023cites this paper
• A New Global Optimization Method Based on Simplex Branching for Solving a Class of Non-Convex QCQP Problems

  2023cites this paper
• Outcome-space branch-and-bound outer approximation algorithm for a class of non-convex quadratic programming problems

  2022influential citation
• A new SOCP relaxation of nonconvex quadratic programming problems with a few negative eigenvalues

  2022cites this paper
• A new global algorithm for factor-risk-constrained mean-variance portfolio selection

  2022cites this paper
• Convergence analysis of modified pth power Lagrangian algorithms with alternative updating strategies for constrained nonconvex optimization

  2021cites this paper
• An efficient global algorithm for worst-case linear optimization under uncertainties based on nonlinear semidefinite relaxation

  2021cites this paper
• A new branch-and-cut algorithm for non-convex quadratic programming via alternative direction method and semidefinite relaxation

  2021cites this paper
• Effective algorithms for optimal portfolio deleveraging problem with cross impact

  2020influential citation
• Global optimization algorithm for solving linear multiplicative programming problems

  2020cites this paper