Properties of two DC algorithms in quadratic programming
From MaRDI portal
(Redirected from Publication:628748)
Recommendations
- A finite algorithm for a particular D.C. quadratic programming problem
- Boundedness of a type of iterative sequences in two-dimensional quadratic programming
- scientific article; zbMATH DE number 4110462
- Linear convergence of a type of iterative sequences in nonconvex quadratic programming
- Solving a class of linearly constrained indefinite quadratic problems by DC algorithms
Cites work
- scientific article; zbMATH DE number 3716008 (Why is no real title available?)
- scientific article; zbMATH DE number 3791104 (Why is no real title available?)
- scientific article; zbMATH DE number 53115 (Why is no real title available?)
- A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
- A branch and bound method via d. c. optimization algorithms and ellipsoidal technique for box constrained nonconvex quadratic problems
- A combined d.c. optimization--ellipsoidal branch-and-bound algorithm for solving nonconvex quadratic programming problems
- A finite algorithm for solving general quadratic problems
- ARPACK Users' Guide
- An efficient algorithm for globally minimizing a quadratic function under convex quadratic constraints
- An efficient combined DCA and B\&B using DC/SDP relaxation for globally solving binary quadratic programs
- Combining DCA (DC Algorithms) and interior point techniques for large-scale nonconvex quadratic programming
- Convex analysis approach to d. c. programming: Theory, algorithms and applications
- Decomposition methods for solving nonconvex quadratic programs via branch and bound
- Large-Scale Molecular Optimization from Distance Matrices by a D.C. Optimization Approach
- Locally unique solutions of quadratic programs, linear and nonlinear complementarity problems
- On Quadratic Programming
- On standard quadratic optimization problems
- Solving a class of linearly constrained indefinite quadratic problems by DC algorithms
- The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
- Une caractérisation complete des minima locaux en programmation quadratique
Cited in
(15)- Second-order optimality conditions for infinite-dimensional quadratic programs
- DC formulations and algorithms for sparse optimization problems
- Solving the degree-concentrated fault-tolerant spanning subgraph problem by DC programming
- Coderivatives of implicit multifunctions and stability of variational systems
- Variational inequalities over Euclidean balls
- A finite algorithm for a particular D.C. quadratic programming problem
- Boundedness of a type of iterative sequences in two-dimensional quadratic programming
- Exact penalty and error bounds in DC programming
- A DC programming approach for solving the symmetric eigenvalue complementarity problem
- Error bounds for the difference of two convex multifunctions
- Linear convergence of a type of iterative sequences in nonconvex quadratic programming
- Local stability and local convergence of the basic trust-region method
- On a solution method in indefinite quadratic programming under linear constraints
- DC programming and DCA for general DC programs
- Stability for trust-region methods via generalized differentiation
This page was built for publication: Properties of two DC algorithms in quadratic programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q628748)
