On convergence of the Gauss-Newton method for convex composite optimization.
From MaRDI portal
(Redirected from Publication:5957569)
Recommendations
- scientific article; zbMATH DE number 1950396
- Convergence of Gauss-Newton method for convex composite optimization. II: Applications
- A Gauss-Newton method for convex composite optimization
- Convergence analysis of the Gauss-Newton method for convex inclusion and convex-composite optimization problems
- scientific article; zbMATH DE number 7326968
- Convergence of the Gauss-Newton method for convex composite optimization under a majorant condition
- Convergence analysis of Gauss-Newton methods for the complementarity problem
- Majorizing Functions and Convergence of the Gauss–Newton Method for Convex Composite Optimization
- scientific article; zbMATH DE number 1839529
- Extending the applicability of the Gauss-Newton method for convex composite optimization using restricted convergence domains and average Lipschitz conditions
Cited in
(28)- Modified inexact Levenberg-Marquardt methods for solving nonlinear least squares problems
- Composite proximal bundle method
- Convergence analysis of the Gauss-Newton-type method for Lipschitz-like mappings
- Local properties of algorithms for minimizing nonsmooth composite functions
- Convergence analysis of Gauss-Newton methods for the complementarity problem
- Strong KKT conditions and weak sharp solutions in convex-composite optimization
- On convergence rates of linearized proximal algorithms for convex composite optimization with applications
- On iterative computation of fixed points and optimization
- Extending the applicability of Gauss-Newton method for convex composite optimization on Riemannian manifolds
- scientific article; zbMATH DE number 1950396 (Why is no real title available?)
- Gauss-Newton method for convex composite optimizations on Riemannian manifolds
- Convergence analysis of the Gauss-Newton method for convex inclusion and convex-composite optimization problems
- Relaxed Gauss-Newton methods with applications to electrical impedance tomography
- Generalized weak sharp minima in cone-constrained convex optimization on Hadamard manifolds
- Convergence of the Gauss-Newton method for convex composite optimization problems under majorant condition on Riemannian manifolds
- Convergence analysis of a proximal Gauss-Newton method
- Convergence of linearized proximal algorithms with adaptive stepsizes for convex composite optimization
- Survey of sequential convex programming and generalized Gauss-Newton methods
- Generalized weak sharp minima in cone-constrained convex optimization with applications
- The equivalence of three types of error bounds for weakly and approximately convex functions
- The value function approach to convergence analysis in composite optimization
- Expanding the applicability of the Gauss-Newton method for convex optimization under a majorant condition
- Linearized proximal algorithms with adaptive stepsizes for convex composite optimization with applications
- The multiproximal linearization method for convex composite problems
- Sharp minima for multiobjective optimization in Banach spaces
- Strong metric (sub)regularity of Karush-Kuhn-Tucker mappings for piecewise linear-quadratic convex-composite optimization and the quadratic convergence of Newton's method
- Accelerated-gradient-based generalized Levenberg-Marquardt method with oracle complexity bound and local quadratic convergence
- Riemannian linearized proximal algorithms for nonnegative inverse eigenvalue problem
This page was built for publication: On convergence of the Gauss-Newton method for convex composite optimization.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5957569)
