An efficient algorithm for globally minimizing a quadratic function under convex quadratic constraints
From MaRDI portal
Publication:1575066
DOI10.1007/s101070050003zbMath0952.90031OpenAlexW1975852795MaRDI QIDQ1575066
Publication date: 25 September 2000
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s101070050003
Related Items
A subgradient-based convex approximations method for DC programming and its applications ⋮ A new branch-and-cut algorithm for non-convex quadratic programming via alternative direction method and semidefinite relaxation ⋮ Convex envelopes of separable functions over regions defined by separable functions of the same type ⋮ DC approximation approaches for sparse optimization ⋮ Difference of convex functions algorithms (DCA) for image restoration via a Markov random field model ⋮ Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO ⋮ Variational multiplicative noise removal by DC programming ⋮ A deterministic global optimization algorithm based on a linearizing method for nonconvex quadratically constrained programs ⋮ DC Programming and DCA for General DC Programs ⋮ DC Programming Approaches for BMI and QMI Feasibility Problems ⋮ A global optimization algorithm using parametric linearization relaxation ⋮ Adaptively weighted difference model of anisotropic and isotropic total variation for image denoising ⋮ Finding robust minimizer for non-convex phase retrieval ⋮ An efficient DC programming approach for portfolio decision with higher moments ⋮ (Global) optimization: historical notes and recent developments ⋮ Properties of two DC algorithms in quadratic programming ⋮ Open issues and recent advances in DC programming and DCA ⋮ Exact penalty and error bounds in DC programming ⋮ A new nonconvex approach for image restoration with Gamma noise ⋮ The Toland-Fenchel-Lagrange duality of DC programs for composite convex functions ⋮ A working set SQCQP algorithm with simple nonmonotone penalty parameters ⋮ Convergence analysis of difference-of-convex algorithm with subanalytic data ⋮ DC programming and DCA for enhancing physical layer security via relay beamforming strategies ⋮ New global algorithms for quadratic programming with a few negative eigenvalues based on alternative direction method and convex relaxation ⋮ Satisfactory fault tolerant control with soft-constraint for discrete time-varying systems: numerical recursive approach ⋮ The exact extreme response and the confidence extreme response analysis of structures subjected to uncertain-but-bounded excitations ⋮ DC programming and DCA: thirty years of developments ⋮ Visualizing data as objects by DC (difference of convex) optimization ⋮ Solving the degree-concentrated fault-tolerant spanning subgraph problem by DC programming ⋮ Simple sequential quadratically constrained quadratic programming feasible algorithm with active identification sets for constrained minimax problems ⋮ A new accelerating method for global non-convex quadratic optimization with non-convex quadratic constraints ⋮ A difference of convex formulation of value-at-risk constrained optimization ⋮ A closedness condition and its applications to DC programs with convex constraints ⋮ Inexact Josephy-Newton framework for generalized equations and its applications to local analysis of Newtonian methods for constrained optimization ⋮ An approach for minimizing a quadratically constrained fractional quadratic problem with application to the communications over wireless channels ⋮ The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems ⋮ DC programming approaches for discrete portfolio optimization under concave transaction costs ⋮ A branch and reduce approach for solving a class of low rank d.c. programs ⋮ Sequential quadratically constrained quadratic programming norm-relaxed algorithm of strongly sub-feasible directions ⋮ Efficient Boosted DC Algorithm for Nonconvex Image Restoration with Rician Noise ⋮ New Splitting Algorithms for Multiplicative Noise Removal Based on Aubert-Aujol Model ⋮ Stochastic Difference-of-Convex-Functions Algorithms for Nonconvex Programming
Uses Software
