A boosted-DCA with power-sum-DC decomposition for linearly constrained polynomial programs

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
Properties of solution set of tensor complementarity problem
Testing copositivity with the help of difference-of-convex optimization
An efficient DC programming approach for portfolio decision with higher moments
A DC programming approach for solving the symmetric eigenvalue complementarity problem
A convex polynomial that is not sos-convex
On functions representable as a difference of convex functions
Global optimization of higher order moments in portfolio selection
On semi- and subanalytic geometry
Decomposition of quantics in sums of powers of linear forms
Solving a class of linearly constrained indefinite quadratic problems by DC algorithms
Convex analysis approach to d. c. programming: Theory, algorithms and applications
An efficient algorithm for globally minimizing a quadratic function under convex quadratic constraints
A fast dual proximal gradient algorithm for convex minimization and applications
A proximal difference-of-convex algorithm with extrapolation
DC programming and DCA: thirty years of developments
DC decomposition of nonconvex polynomials with algebraic techniques
Accelerating the DC algorithm for smooth functions
DC formulations and algorithms for sparse optimization problems
The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
Undominated d.c. decompositions of quadratic functions and applications to branch-and-bound approaches
Improved dc programming approaches for solving the quadratic eigenvalue complementarity problem
Discrete dynamical system approaches for Boolean polynomial optimization
An inertial algorithm for DC programming
Splitting methods with variable metric for Kurdyka-Łojasiewicz functions and general convergence rates
A complete characterization of the gap between convexity and sos-convexity
Efficient DC programming approaches for the asymmetric eigenvalue complementarity problem
Improved Convergence Rates for Lasserre-Type Hierarchies of Upper Bounds for Box-Constrained Polynomial Optimization
DC Programming Approaches for BMI and QMI Feasibility Problems
Sums of even powers of real linear forms
Linear Matrix Inequalities in System and Control Theory
A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
First-Order Methods in Optimization
The Euclidian Distance Matrix Completion Problem
The Boosted Difference of Convex Functions Algorithm for Nonsmooth Functions
Solving the Quadratic Eigenvalue Complementarity Problem by DC Programming
The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems
Some methods of speeding up the convergence of iteration methods
DC programming approaches for discrete portfolio optimization under concave transaction costs
Copositivity tests based on the linear complementarity problem
A refined inertial DC algorithm for DC programming

This page was built for publication: A boosted-DCA with power-sum-DC decomposition for linearly constrained polynomial programs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6536842)