DC-programming for neural network optimizations
From MaRDI portal
Cites work
- 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 D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
- A proof of convergence of the concave-convex procedure using Zangwill's theory
- Addendum to: ``Multiple-source adaptation theory and algorithms
- Convex analysis approach to d. c. programming: Theory, algorithms and applications
- Convexity, Classification, and Risk Bounds
- DC programming and DCA: thirty years of developments
- DC programming: overview.
- Deep learning
- Discrepancy-based theory and algorithms for forecasting non-stationary time series
- Foundations of machine learning
- How to compare different loss functions and their risks
- scientific article; zbMATH DE number 6310870 (Why is no real title available?)
- scientific article; zbMATH DE number 3215121 (Why is no real title available?)
- Learning algorithms for second-price auctions with reserve
- Multilayer feedforward networks are universal approximators
- Multiple-source adaptation theory and algorithms
- On the consistency of multiclass classification methods
- Statistical behavior and consistency of classification methods based on convex risk minimization.
- Support-vector networks
- The Concave-Convex Procedure
- The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
This page was built for publication: DC-programming for neural network optimizations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7298909)
