New methods for parametric optimization via differential equations
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 5957245 (Why is no real title available?)
- scientific article; zbMATH DE number 48687 (Why is no real title available?)
- scientific article; zbMATH DE number 3579922 (Why is no real title available?)
- scientific article; zbMATH DE number 729680 (Why is no real title available?)
- A continuous dynamical Newton-like approach to solving monotone inclusions
- A dynamic approach to a proximal-Newton method for monotone inclusions in Hilbert spaces, with complexity \(\mathcal{O}(1/n^2)\)
- A generic path algorithm for regularized statistical estimation
- A mathematical view of interior-point methods in convex optimization
- A new approach to variable selection in least squares problems
- A second-order gradient-like dissipative dynamical system with Hessian-driven damping. Application to optimization and mechanics.
- A variational perspective on accelerated methods in optimization
- An Algorithm for Least-Squares Estimation of Nonlinear Parameters
- An inertial proximal method for maximal monotone operators via discretization of a nonlinear oscillator with damping
- Approximating parameterized convex optimization problems
- Considering cost asymmetry in learning classifiers
- Cubic regularization of Newton method and its global performance
- Efficient global approximation of generalized nonlinear \(\ell _{1}\)-regularized solution paths and its applications
- Fast convergence of inertial dynamics and algorithms with asymptotic vanishing viscosity
- Global Convergence of Damped Newton's Method for Nonsmooth Equations via the Path Search
- Least angle regression. (With discussion)
- Model predictive control: Theory and practice - a survey
- Newton-like dynamics and forward-backward methods for structured monotone inclusions in Hilbert spaces
- Numerical analysis.
- Optimal computational and statistical rates of convergence for sparse nonconvex learning problems
- Path following in the exact penalty method of convex programming
- Piecewise linear regularized solution paths
- Regularized Newton method for unconstrained convex optimization
- Second order forward-backward dynamical systems for monotone inclusion problems
- SparseNet: coordinate descent with nonconvex penalties
- Spectral regularization algorithms for learning large incomplete matrices
- Trust Region Methods
This page was built for publication: New methods for parametric optimization via differential equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6952581)
