Incremental quasi-Newton algorithms for solving a nonconvex, nonsmooth, finite-sum optimization problem
From MaRDI portal
Recommendations
- A quasi-Newton approach to nonsmooth convex optimization problems in machine learning
- An approximate quasi-Newton bundle-type method for nonsmooth optimization
- A bundle-type quasi-Newton method for nonconvex nonsmooth optimization
- A quasi-Newton algorithm for nonconvex, nonsmooth optimization with global convergence guarantees
- Forward-backward quasi-Newton methods for nonsmooth optimization problems
Cites work
- A Characterization of Superlinear Convergence and Its Application to Quasi-Newton Methods
- A Convergent Incremental Gradient Method with a Constant Step Size
- A Family of Variable-Metric Methods Derived by Variational Means
- A globally convergent incremental Newton method
- A modified BFGS method and its global convergence in nonconvex minimization
- A new approach to variable metric algorithms
- A numerical evaluation of several stochastic algorithms on selected continuous global optimization test problems
- A particle swarm pattern search method for bound constrained global optimization
- A quasi-Newton algorithm for nonconvex, nonsmooth optimization with global convergence guarantees
- A self-correcting variable-metric algorithm framework for nonsmooth optimization
- A stochastic quasi-Newton method for large-scale optimization
- A survey on semi-supervised learning
- Accelerating incremental gradient optimization with curvature information
- Benchmarking optimization software with performance profiles.
- Best practices for comparing optimization algorithms
- Conditioning of Quasi-Newton Methods for Function Minimization
- Convergence of Approximate and Incremental Subgradient Methods for Convex Optimization
- Convergence rate of incremental gradient and incremental Newton methods
- DC programming: overview.
- Global Convergence of a Cass of Quasi-Newton Methods on Convex Problems
- scientific article; zbMATH DE number 5957380 (Why is no real title available?)
- scientific article; zbMATH DE number 5060482 (Why is no real title available?)
- Incremental gradient algorithms with stepsizes bounded away from zero
- Incremental quasi-subgradient methods for minimizing the sum of quasi-convex functions
- Incremental stochastic subgradient algorithms for convex optimization
- Incremental subgradient method for nonsmooth convex optimization with fixed point constraints
- Incremental subgradient methods for nondifferentiable optimization
- IQN: an incremental quasi-Newton method with local superlinear convergence rate
- Manifold regularization: a geometric framework for learning from labeled and unlabeled examples
- Minimizing Nonconvex Nonsmooth Functions via Cutting Planes and Proximity Control
- Modern nonconvex nondifferentiable optimization
- Nonsmooth optimization via quasi-Newton methods
- On the Convergence Rate of Incremental Aggregated Gradient Algorithms
- On the global convergence of the BFGS method for nonconvex unconstrained optimization problems
- On the Local and Superlinear Convergence of Quasi-Newton Methods
- On the use of stochastic Hessian information in optimization methods for machine learning
- Optimality conditions and a smoothing trust region Newton method for nonlipschitz optimization
- Optimization and nonsmooth analysis
- Optimization techniques for semi-supervised support vector machines
- Smoothing methods for nonsmooth, nonconvex minimization
- Stochastic L-BFGS: Improved Convergence Rates and Practical Acceleration Strategies
- Strong and Weak Convexity of Sets and Functions
- Subgradient methods for sharp weakly convex functions
- Support vector machine polyhedral separability in semisupervised learning
- The Convergence of a Class of Double-rank Minimization Algorithms 1. General Considerations
This page was built for publication: Incremental quasi-Newton algorithms for solving a nonconvex, nonsmooth, finite-sum optimization problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6586914)
