Felix: Optimizing Tensor Programs with Gradient Descent
Abstract
References
Recommendations
A sufficient descent nonlinear conjugate gradient method for solving M-tensor equations
AbstractTensor equations is a kind of important tensor optimization problems with higher order nonlinear equations, which are widely used in engineering and economics. This paper is concerned with solving M-tensor equations. We transform M-tensor ...
Descent three-term conjugate gradient methods based on secant conditions for unconstrained optimization
The conjugate gradient method is an effective method for large-scale unconstrained optimization problems. Recent research has proposed conjugate gradient methods based on secant conditions to establish fast convergence of the methods. However, these ...
Spectral conjugate gradient methods with sufficient descent property for large-scale unconstrained optimization
Dedicated to Professor Michael J.D. Powell on the occasion of his 70th birthdayA class of new spectral conjugate gradient methods are proposed in this paper. First, we modify the spectral Perry's conjugate gradient method, which is the best spectral conjugate gradient algorithm SCG by Birgin and Martinez [E.G. Birgin and J.M. ...
Comments
Information & Contributors
Information
Published In
- General Chairs:
- Nael Abu-Ghazaleh,
- Rajiv Gupta,
- Program Chairs:
- Madan Musuvathi,
- Dan Tsafrir
Sponsors
In-Cooperation
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Check for updates
Qualifiers
- Research-article
Funding Sources
Conference
Acceptance Rates
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 941Total Downloads
- Downloads (Last 12 months)941
- Downloads (Last 6 weeks)144
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in