On convergence of the Gauss-Newton method for convex composite optimization.

DOI10.1007/S101070100249zbMATH Open1049.90132OpenAlexW2082725151MaRDI QIDQ5957569FDOQ5957569

Authors: C. Li, Xinghua Wang 

Publication date: 2002

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s101070100249

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

zbMATH Keywords

regular pointquadratic convergenceGauss-Newton methodweak sharp minima

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Methods of quasi-Newton type (90C53)

Cited In (26)

• 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
• On convergence rates of linearized proximal algorithms for convex composite optimization with applications
• Strong KKT conditions and weak sharp solutions in convex-composite optimization
• On iterative computation of fixed points and optimization
• Title not available (Why is that?)
• Extending the applicability of Gauss-Newton method for convex composite optimization on Riemannian manifolds
• 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
• 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
• Riemannian linearized proximal algorithms for nonnegative inverse eigenvalue problem
• Strong metric (sub)regularity of Karush-Kuhn-Tucker mappings for piecewise linear-quadratic convex-composite optimization and the quadratic convergence of Newton's method
• Sharp minima for multiobjective optimization in Banach spaces

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)