Pages that link to "Item:Q1575066"
From MaRDI portal
The following pages link to An efficient algorithm for globally minimizing a quadratic function under convex quadratic constraints (Q1575066):
Displaying 50 items.
- DC approximation approaches for sparse optimization (Q319281) (← links)
- Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO (Q322958) (← links)
- Variational multiplicative noise removal by DC programming (Q333222) (← links)
- An efficient DC programming approach for portfolio decision with higher moments (Q409263) (← links)
- Exact penalty and error bounds in DC programming (Q427389) (← links)
- An improved closed-form solution for the constrained minimization of the root of a quadratic functional (Q442731) (← links)
- Satisfactory fault tolerant control with soft-constraint for discrete time-varying systems: numerical recursive approach (Q509390) (← links)
- Properties of two DC algorithms in quadratic programming (Q628748) (← links)
- A working set SQCQP algorithm with simple nonmonotone penalty parameters (Q654747) (← links)
- A branch and reduce approach for solving a class of low rank d.c. programs (Q732158) (← links)
- A new branch-and-cut algorithm for non-convex quadratic programming via alternative direction method and semidefinite relaxation (Q820743) (← links)
- A global optimization algorithm using parametric linearization relaxation (Q876659) (← links)
- Inexact Josephy-Newton framework for generalized equations and its applications to local analysis of Newtonian methods for constrained optimization (Q975356) (← links)
- Sequential quadratically constrained quadratic programming norm-relaxed algorithm of strongly sub-feasible directions (Q1044081) (← links)
- Quadratic problems defined on a convex hull of points (Q1102708) (← links)
- A monotonicity based approach to nonconvex quadratic minimization (Q1399081) (← links)
- An algorithm for global minimization of linearly constrained quadratic functions (Q1579950) (← links)
- Convex envelopes of separable functions over regions defined by separable functions of the same type (Q1634777) (← links)
- Difference of convex functions algorithms (DCA) for image restoration via a Markov random field model (Q1642987) (← links)
- Convergence analysis of difference-of-convex algorithm with subanalytic data (Q1730802) (← links)
- New global algorithms for quadratic programming with a few negative eigenvalues based on alternative direction method and convex relaxation (Q1741128) (← links)
- DC programming and DCA: thirty years of developments (Q1749443) (← links)
- Visualizing data as objects by DC (difference of convex) optimization (Q1749447) (← links)
- Solving the degree-concentrated fault-tolerant spanning subgraph problem by DC programming (Q1749453) (← links)
- The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems (Q1772961) (← links)
- The exact extreme response and the confidence extreme response analysis of structures subjected to uncertain-but-bounded excitations (Q1988812) (← links)
- A new nonconvex approach for image restoration with Gamma noise (Q2203959) (← links)
- DC programming and DCA for enhancing physical layer security via relay beamforming strategies (Q2230771) (← links)
- Simple sequential quadratically constrained quadratic programming feasible algorithm with active identification sets for constrained minimax problems (Q2250067) (← links)
- A subgradient-based convex approximations method for DC programming and its applications (Q2358301) (← links)
- A deterministic global optimization algorithm based on a linearizing method for nonconvex quadratically constrained programs (Q2389836) (← links)
- The Toland-Fenchel-Lagrange duality of DC programs for composite convex functions (Q2438323) (← links)
- A new accelerating method for global non-convex quadratic optimization with non-convex quadratic constraints (Q2479256) (← links)
- Branch-and-bound method for the minimization problem for a nonconvex quadratic function under convex quadratic constraints (Q2713937) (← links)
- (Q3035144) (← links)
- An Optimal Algorithm for Minimization of Quadratic Functions with Bounded Spectrum Subject to Separable Convex Inequality and Linear Equality Constraints (Q3083314) (← links)
- DC Programming and DCA for General DC Programs (Q3192952) (← links)
- DC Programming Approaches for BMI and QMI Feasibility Problems (Q3192953) (← links)
- A difference of convex formulation of value-at-risk constrained optimization (Q3577837) (← links)
- A closedness condition and its applications to DC programs with convex constraints (Q3577846) (← links)
- An Algorithm for Global Minimization of Linearly Constrained Concave Quadratic Functions (Q3780011) (← links)
- A dual algorithm for minimizing a quadratic function with two quadratic constraints (Q3990277) (← links)
- (Q4677720) (← links)
- Global minimization of indefinite quadratic functions subject to box constraints (Q4697332) (← links)
- An approach for minimizing a quadratically constrained fractional quadratic problem with application to the communications over wireless channels (Q5746701) (← links)
- Efficient Boosted DC Algorithm for Nonconvex Image Restoration with Rician Noise (Q5863519) (← links)
- New Splitting Algorithms for Multiplicative Noise Removal Based on Aubert-Aujol Model (Q5864782) (← links)
- Stochastic Difference-of-Convex-Functions Algorithms for Nonconvex Programming (Q5869814) (← links)
- DC programming approaches for discrete portfolio optimization under concave transaction costs (Q5963231) (← links)
- Adaptively weighted difference model of anisotropic and isotropic total variation for image denoising (Q6085634) (← links)
