High-order optimization methods for fully composite problems
From MaRDI portal
Recommendations
Cites work
- A Gauss-Newton method for convex composite optimization
- A moving balls approximation method for a class of smooth constrained minimization problems
- A new constraint qualification for the formula of the subdifferential of composed convex functions in infinite dimensional spaces
- A proximal method for composite minimization
- A study of convex convex-composite functions via infimal convolution with applications
- Accelerating the cubic regularization of Newton's method on convex problems
- Algorithms for nonlinear constraints that use lagrangian functions
- An accelerated hybrid proximal extragradient method for convex optimization and its implications to second-order methods
- Complexity bounds for primal-dual methods minimizing the model of objective function
- Composite difference-MAX programs for modern statistical estimation problems
- Contracting proximal methods for smooth convex optimization
- Cubic regularization of Newton method and its global performance
- Descent methods for composite nondifferentiable optimization problems
- Efficiency of minimizing compositions of convex functions and smooth maps
- Epi-convergent smoothing with applications to convex composite functions
- Error bounds, quadratic growth, and linear convergence of proximal methods
- Farkas-type results for inequality systems with composed convex functions via conjugate duality
- Generalized Moreau–Rockafellar results for composed convex functions
- Global convergence rate analysis of unconstrained optimization methods based on probabilistic models
- Gradient methods for minimizing composite functions
- scientific article; zbMATH DE number 3850830 (Why is no real title available?)
- scientific article; zbMATH DE number 3583207 (Why is no real title available?)
- scientific article; zbMATH DE number 729680 (Why is no real title available?)
- scientific article; zbMATH DE number 1393065 (Why is no real title available?)
- Implementable tensor methods in unconstrained convex optimization
- Lectures on convex optimization
- Minimizing uniformly convex functions by cubic regularization of Newton method
- Modified Gauss–Newton scheme with worst case guarantees for global performance
- New constraint qualification and conjugate duality for composed convex optimization problems
- New Proximal Point Algorithms for Convex Minimization
- On the evaluation complexity of composite function minimization with applications to nonconvex nonlinear programming
- Optimality conditions for non-finite valued convex composite functions
- Oracle complexity of second-order methods for smooth convex optimization
- Regularized Newton methods for minimizing functions with Hölder continuous hessians
- Second order necessary and sufficient conditions for convex composite NDO
- Smoothness parameter of power of Euclidean norm
- Strong metric (sub)regularity of Karush-Kuhn-Tucker mappings for piecewise linear-quadratic convex-composite optimization and the quadratic convergence of Newton's method
- Tensor methods for minimizing convex functions with Hölder continuous higher-order derivatives
- The multiproximal linearization method for convex composite problems
Cited in
(8)- Regularized Newton Method with Global \({\boldsymbol{\mathcal{O}(1/{k}^2)}}\) Convergence
- Efficiency of higher-order algorithms for minimizing composite functions
- Optimization Methods for Fully Composite Problems
- High-order methods beyond the classical complexity bounds: inexact high-order proximal-point methods
- Moving higher-order Taylor approximations method for smooth constrained minimization problems
- Accelerated first-order optimization under nonlinear constraints
- Preconditioned Barzilai-Borwein methods for multiobjective optimization problems
- An inexact q-order regularized proximal Newton method for nonconvex composite optimization
This page was built for publication: High-order optimization methods for fully composite problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5869820)
