- Home
- Publications
- Publication Search
- Publication Details
Title
Implementable tensor methods in unconstrained convex optimization
Authors
Keywords
-
Journal
MATHEMATICAL PROGRAMMING
Volume -, Issue -, Pages -
Publisher
Springer Science and Business Media LLC
Online
2019-11-21
DOI
10.1007/s10107-019-01449-1
References
Ask authors/readers for more resources
Related references
Note: Only part of the references are listed.- Universal Regularization Methods: Varying the Power, the Smoothness and the Accuracy
- (2019) Coralia Cartis et al. SIAM JOURNAL ON OPTIMIZATION
- On the use of third-order models with fourth-order regularization for unconstrained optimization
- (2019) E. G. Birgin et al. Optimization Letters
- Relatively Smooth Convex Optimization by First-Order Methods, and Applications
- (2018) Haihao Lu et al. SIAM JOURNAL ON OPTIMIZATION
- A Descent Lemma Beyond Lipschitz Gradient Continuity: First-Order Methods Revisited and Applications
- (2017) Heinz H. Bauschke et al. MATHEMATICS OF OPERATIONS RESEARCH
- Regularized Newton Methods for Minimizing Functions with Hölder Continuous Hessians
- (2017) G. N. Grapiglia et al. SIAM JOURNAL ON OPTIMIZATION
- Worst-case evaluation complexity for unconstrained nonlinear optimization using high-order regularized models
- (2016) E. G. Birgin et al. MATHEMATICAL PROGRAMMING
- Complexity analysis of interior point algorithms for non-Lipschitz and nonconvex minimization
- (2014) Wei Bian et al. MATHEMATICAL PROGRAMMING
- Universal gradient methods for convex optimization problems
- (2014) Yu Nesterov MATHEMATICAL PROGRAMMING
- On the convergence and worst-case complexity of trust-region and regularization methods for unconstrained optimization
- (2014) Geovani N. Grapiglia et al. MATHEMATICAL PROGRAMMING
- An Accelerated Hybrid Proximal Extragradient Method for Convex Optimization and Its Implications to Second-Order Methods
- (2013) Renato D. C. Monteiro et al. SIAM JOURNAL ON OPTIMIZATION
- Gradient methods for minimizing composite functions
- (2012) Yu. Nesterov MATHEMATICAL PROGRAMMING
- Evaluation complexity of adaptive cubic regularization methods for convex unconstrained optimization
- (2011) Coralia Cartis et al. OPTIMIZATION METHODS & SOFTWARE
- Adaptive cubic regularisation methods for unconstrained optimization. Part II: worst-case function- and derivative-evaluation complexity
- (2010) Coralia Cartis et al. MATHEMATICAL PROGRAMMING
- Adaptive cubic regularisation methods for unconstrained optimization. Part I: motivation, convergence and numerical results
- (2009) Coralia Cartis et al. MATHEMATICAL PROGRAMMING
- On large-scale unconstrained optimization problems and higher order methods
- (2009) Geir Gundersen et al. OPTIMIZATION METHODS & SOFTWARE
Publish scientific posters with Peeref
Peeref publishes scientific posters from all research disciplines. Our Diamond Open Access policy means free access to content and no publication fees for authors.
Learn MoreCreate your own webinar
Interested in hosting your own webinar? Check the schedule and propose your idea to the Peeref Content Team.
Create Now