Majorizing Functions and Convergence of the Gauss–Newton Method for Convex Composite Optimization
From MaRDI portal
Publication:3503211
DOI10.1137/06065622XzbMath1153.90012MaRDI QIDQ3503211
Publication date: 22 May 2008
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
90C25: Convex programming
65H10: Numerical computation of solutions to systems of equations
90C53: Methods of quasi-Newton type
41A29: Approximation with constraints
47J15: Abstract bifurcation theory involving nonlinear operators
Related Items
Quantitative Analysis for Perturbed Abstract Inequality Systems in Banach Spaces, Extended Newton Methods for Multiobjective Optimization: Majorizing Function Technique and Convergence Analysis, On iterative computation of fixed points and optimization, Extended Newton methods for conic inequalities: approximate solutions and the extended Smale \(\alpha\)-theory, Extending the applicability of Gauss-Newton method for convex composite optimization on Riemannian manifolds, Extending the applicability of the Gauss-Newton method for convex composite optimization using restricted convergence domains and average Lipschitz conditions, Convergence analysis of the Gauss-Newton-type method for Lipschitz-like mappings, Gauss-Newton method for convex composite optimizations on Riemannian manifolds, A robust semi-local convergence analysis of Newton's method for cone inclusion problems in Banach spaces under affine invariant majorant condition, Expanding the applicability of the Gauss-Newton method for convex optimization under a majorant condition, Local convergence analysis of inexact Gauss-Newton method for singular systems of equations under majorant and center-majorant condition, Metric subregularity for composite-convex generalized equations in Banach spaces, Strong KKT conditions and weak sharp solutions in convex-composite optimization, Extending the applicability of the Gauss-Newton method under average Lipschitz-type conditions, Convergence analysis of the Gauss-Newton method for convex inclusion and convex-composite optimization problems, Uniform subsmoothness and linear regularity for a collection of infinitely many closed sets, Convergence behavior of Gauss-Newton's method and extensions of the Smale point estimate theory, Constraint qualifications for optimality conditions and total Lagrange dualities in convex infinite programming, The value function approach to convergence analysis in composite optimization, Convergence analysis of a proximal Gauss-Newton method, Semi-local convergence of the Newton-HSS method under the center Lipschitz condition, Extended Newton-type method and its convergence analysis for nonsmooth generalized equations, On Convergence Rates of Linearized Proximal Algorithms for Convex Composite Optimization with Applications, On the convergence of extended Newton-type method for solving variational inclusions
