Globally solving nonconvex quadratic programming problems via completely positive programming

No abstract is available for this paper.

• Publication year

  2011

• Venue

  Mathematical Programming Computation

• Publication date

  2011-11-16

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1007/s12532-011-0033-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.

• Optimizing a polyhedral-semidefinite relaxation of completely positive programs

  2010influential reference
• Outlier detection and least trimmed squares approximation using semi-definite programming

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

  2009cited by this paper
• On the copositive representation of binary and continuous nonconvex quadratic programs

  2009influential reference
• Branching and bounds tighteningtechniques for non-convex MINLP

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

  2008influential reference
• Solving Lift-and-Project Relaxations of Binary Integer Programs

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

  2005cited by this paper
• CUTEr and SifDec: A constrained and unconstrained testing environment, revisited

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

  2002cited by this paper
• Benchmarking optimization software with performance profiles

  2001cited by this paper
• Convex quadratic and semidefinite programming relaxations in scheduling

  2001cited by this paper
• A Reformulation-Linearization Technique for Solving Discrete and Continuous Nonconvex Problems

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

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

  1991cited by this paper
• Cones of Matrices and Set-Functions and 0-1 Optimization

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

  1991cited by this paper
• Algorithms for bound constrained quadratic programming problems

  1989cited by this paper
• An alternating direction implicit algorithm for the solution of linear complementarity problems arising from free boundary problems

  1985cited by this paper
• A TRUST REGION STRATEGY FOR NONLINEAR EQUALITY CONSTRAINED OPTIMIZATION (NONLINEAR PROGRAMMING, SEQUENTIAL QUADRATIC)

  1985cited by this paper

• Quadratic Optimization Through the Lens of Adjustable Robust Optimization

  2025cites this paper
• Optimizing global risk-conscious portfolios: the strategic role of Sharia-compliant and ESG investments

  2025cites this paper
• Portfolio selection based on the Herd Behavior Index

  2025cites this paper
• Optimizing a Linearly Constrained Quadratic Programming Problem Using Eigen-Value Decomposition and Resultant Vector Ascent Method

  2025cites this paper
• Non-convex optimization problems with linear KKT subsystem

  2025cites this paper
• Enhancing Quadratic Programming Solvers via Quadratic Nonconvex Reformulation

  2025cites this paper
• Exact and Heuristic Algorithms for Constrained Biclustering

  2025cites this paper
• Progressive Bound Strengthening via Doubly Nonnegative Cutting Planes for Nonconvex Quadratic Programs

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

  2025cites this paper
• Using quadratic cuts to iteratively strengthen convexifications of box quadratic programs

  2025cites this paper
• Relaxations of KKT Conditions do not Strengthen Finite RLT and SDP-RLT Bounds for Nonconvex Quadratic Programs

  2025cites this paper
• Improving the solution of indefinite quadratic programs and linear programs with complementarity constraints by a progressive MIP method

  2024influential citation
• A Global Solution Algorithm for AC Optimal Power Flow through Linear Constrained Quadratic Programming

  2024cites this paper
• IPM-LSTM: A Learning-Based Interior Point Method for Solving Nonlinear Programs

  2024cites this paper
• Initialization of the difference of convex functions optimization algorithm for nonconvex quadratic problems

  2024cites this paper
• Globally solving concave quadratic programs via doubly nonnegative relaxation

  2023cites this paper
• Enhancements of discretization approaches for non-convex mixed-integer quadratically constrained quadratic programming: part II

  2023cites this paper
• Optimal Traffic Signal Control of Isolated Oversaturated Intersections Using Predicted Demand

  2023cites this paper
• OsmoticGate: Adaptive Edge-Based Real-Time Video Analytics for the Internet of Things

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

  2023cites this paper
• Effective algorithms for separable nonconvex quadratic programming with one quadratic and box constraints

  2023cites this paper
• Finding local optima in quadratic optimization problems in RP

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

  2023cites this paper
• An efficient global algorithm for indefinite separable quadratic knapsack problems with box constraints

  2023cites this paper
• Using general triangle inequalities within quadratic convex reformulation method

  2023cites this paper
• Cutting Plane Generation through Sparse Principal Component Analysis

  2022cites this paper
• Enhancements of Discretization Approaches for Non-Convex Mixed-Integer Quadratically Constraint Quadratic Programming

  2022cites this paper
• Enhancements of discretization approaches for non-convex mixed-integer quadratically constrained quadratic programming: Part I

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

  2022cites this paper
• Adaptive Global Algorithm for Solving Box-Constrained Non-convex Quadratic Minimization Problems

  2022cites this paper
• Fix and bound: an efficient approach for solving large-scale quadratic programming problems with box constraints

  2022influential citation
• A new global algorithm for factor-risk-constrained mean-variance portfolio selection

  2022cites this paper
• Parabolic Relaxation for Quadratically-constrained Quadratic Programming - Part I: Definitions & Basic Properties

  2022cites this paper
• A computational study on QP problems with general linear constraints

  2022cites this paper
• Compact mixed-integer programming formulations in quadratic optimization

  2022cites 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
• New notions of simultaneous diagonalizability of quadratic forms with applications to QCQPs

  2021cites this paper
• Quantum-inspired Formulations for the Max 𝑘 -cut Problem

  2021cites this paper
• (Global) Optimization: Historical notes and recent developments

  2021cites this paper
• A distributionally robust optimization approach for two-stage facility location problems

  2020cites this paper
• A low-dimensional SDP relaxation based spatial branch and bound method for nonconvex quadratic programs

  2020cites this paper
• Computing mixed strategies equilibria in presence of switching costs by the solution of nonconvex QP problems

  2020cites this paper
• Penalized semidefinite programming for quadratically-constrained quadratic optimization

  2020cites this paper
• Valid inequalities and global solution algorithm for Quadratically Constrained Quadratic Programs

  2020cites this paper
• Tutorials on Advanced Optimization Methods

  2020cites this paper
• QPALM: a proximal augmented lagrangian method for nonconvex quadratic programs

  2020cites this paper
• A successive linear approximation algorithm for the global minimization of a concave quadratic program

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

  2020cites this paper
• A simultaneous diagonalization-based quadratic convex reformulation for nonconvex quadratically constrained quadratic program

  2020cites this paper
• DESEMPEÑO DE ALGORITMOS HEURÍSTICOS EN LA SOLUCIÓN DE PROBLEMAS CUADRÁTICOS NO CONVEXOS CON RESTRICCIONES DE CAJA

  2020influential citation
• Scoring positive semidefinite cutting planes for quadratic optimization via trained neural networks

  2019cites this paper
• Global solution of non-convex quadratically constrained quadratic programs

  2019influential citation
• A new algorithm for concave quadratic programming

  2019cites this paper
• Multi-Tone Signal Optimization for Wireless Power Transfer in the Presence of Wireless Communication Links

  2019cites this paper
• R&D Networks: Theory, Empirics, and Policy Implications

  2019influential citation
• Solving Quadratic Programming by Cutting Planes

  2019cites this paper
• New global algorithms for quadratic programming with a few negative eigenvalues based on alternative direction method and convex relaxation

  2018cites this paper
• A new dual for quadratic programming and its applications

  2018influential citation
• Constrained optimization as ecological dynamics with applications to random quadratic programming in high dimensions.

  2018cites this paper
• Globally solving nonconvex quadratic programming problems with box constraints via integer programming methods

  2018influential citation
• A binarisation heuristic for non-convex quadratic programming with box constraints

  2018cites this paper
• Compact Disjunctive Approximations to Nonconvex Quadratically Constrained Programs

  2018cites this paper
• A sensitive-eigenvector based global algorithm for quadratically constrained quadratic programming

  2018cites this paper
• Selecting cutting planes for quadratic semidefinite outer-approximation via trained neural networks

  2018cites this paper
• Optimal Energy Storage Strategies in Microgrids

  2018cites this paper
• Polynomial Optimization via Penalized Conic Relaxation

  2018cites this paper
• Global solutions of nonconvex standard quadratic programs via mixed integer linear programming reformulations

  2018cites this paper
• Online Appendix for “R&D Networks: Theory, Empirics and Policy Implications”

  2018cites this paper
• Improved Decision Rule Approximations for Multistage Robust Optimization via Copositive Programming

  2018cites this paper
• General Heuristics for Nonconvex Quadratically Constrained Quadratic Programming

  2017cites this paper
• A branch and bound algorithm for nonconvex quadratic optimization with ball and linear constraints

  2017influential citation
• Optimization under uncertainty: conic programming representations, relaxations, and approximations

  2017influential citation
• Domain reduction techniques for global NLP and MINLP optimization

  2017cites this paper
• On global optimization with indefinite quadratics

  2017cites this paper
• Conic Programming Approaches for Polynomial Optimization: Theory and Applications

  2017cites this paper
• Bounds tightening based on optimality conditions for nonconvex box-constrained optimization

  2017cites this paper
• DC decomposition based branch-and-bound algorithms for box-constrained quadratic programs

  2017influential citation
• Guaranteed Non-convex Optimization: Submodular Maximization over Continuous Domains

  2016cites this paper
• Problem of hydroelectric resources management: Numerical approach

  2016cites this paper
• Outer-product-free sets for polynomial optimization and oracle-based cuts

  2016cites this paper
• Approximate fuzzy analysis of linear structural systems applying intervening variables

  2016cites this paper
• Resource Management in Real-time Multicore Embedded Systems: Performance and Energy Perspectives

  2016cites this paper
• Quadratic Programming with Discrete Variables

  2016cites this paper
• A spatial branch-and-cut method for nonconvex QCQP with bounded complex variables

  2016influential citation
• Solving Box-Constrained Nonconvex Quadratic Programs

  2016influential citation
• An eigenvalue decomposition based branch-and-bound algorithm for nonconvex quadratic programming problems with convex quadratic constraints

  2016cites this paper
• Exactness conditions for an SDP relaxation of the extended trust region problem

  2016cites this paper
• Tight bounds on indefinite separable singly-constrained quadratic programs in linear-time

  2016cites this paper
• Completely positive and completely positive semidefinite tensor relaxations for polynomial optimization

  2016cites this paper
• Semidefinite Approaches for MIQCP: Convex Relaxations and Practical Methods

  2015cites this paper
• Globally Solving Nonconvex Quadratic Programs via Linear Integer Programming Techniques

  2015influential citation
• An Ecient Global Algorithm for a Class of Indenite

  2015cites this paper
• Concentrated portfolio selection models based on historical data

  2015cites this paper
• Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2

  2015cites this paper
• A Solution Approach for Multi-level Integer Indefinite Quadratic Programming Problems

  2015cites this paper
• A Regularized Monotonic Fuzzy Support Vector Machine Model for Data Mining With Prior Knowledge

  2015cites this paper
• An efficient global algorithm for a class of indefinite separable quadratic programs

  2015cites this paper
• Robust Investment Management with Uncertainty in Fund Managers' Asset Allocation

  2015influential citation
• Completely positive reformulations for polynomial optimization

  2015cites this paper