Majorizing Functions and Convergence of the Gauss–Newton Method for Convex Composite Optimization

From MaRDI portal
Revision as of 23:53, 4 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:3503211

DOI10.1137/06065622XzbMath1153.90012OpenAlexW2025702035MaRDI QIDQ3503211

Chong Li, Ng Kung-fu

Publication date: 22 May 2008

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/06065622x




Related Items

On iterative computation of fixed points and optimizationExtended Newton methods for conic inequalities: approximate solutions and the extended Smale \(\alpha\)-theoryExtending the applicability of Gauss-Newton method for convex composite optimization on Riemannian manifoldsOn semilocal convergence analysis for two-step Newton method under generalized Lipschitz conditions in Banach spacesExtending the applicability of the Gauss-Newton method for convex composite optimization using restricted convergence domains and average Lipschitz conditionsConvergence analysis of the Gauss-Newton-type method for Lipschitz-like mappingsExtended Newton-type method and its convergence analysis for nonsmooth generalized equationsConvergence analysis of a proximal Gauss-Newton methodThe multiproximal linearization method for convex composite problemsStrong KKT conditions and weak sharp solutions in convex-composite optimizationRiemannian linearized proximal algorithms for nonnegative inverse eigenvalue problemEfficiency of higher-order algorithms for minimizing composite functionsConvergence of the Gauss-Newton method for convex composite optimization problems under majorant condition on Riemannian manifoldsLinearized proximal algorithms with adaptive stepsizes for convex composite optimization with applicationsExtending the applicability of the Gauss-Newton method under average Lipschitz-type conditionsThe value function approach to convergence analysis in composite optimizationGauss-Newton method for convex composite optimizations on Riemannian manifoldsA robust semi-local convergence analysis of Newton's method for cone inclusion problems in Banach spaces under affine invariant majorant conditionConvergence analysis of the Gauss-Newton method for convex inclusion and convex-composite optimization problemsExpanding the applicability of the Gauss-Newton method for convex optimization under a majorant conditionLocal convergence analysis of inexact Gauss-Newton method for singular systems of equations under majorant and center-majorant conditionMetric subregularity for composite-convex generalized equations in Banach spacesUniform subsmoothness and linear regularity for a collection of infinitely many closed setsConvergence behavior of Gauss-Newton's method and extensions of the Smale point estimate theorySemi-local convergence of the Newton-HSS method under the center Lipschitz conditionConstraint qualifications for optimality conditions and total Lagrange dualities in convex infinite programmingQuantitative Analysis for Perturbed Abstract Inequality Systems in Banach SpacesOn Convergence Rates of Linearized Proximal Algorithms for Convex Composite Optimization with ApplicationsOn the convergence of extended Newton-type method for solving variational inclusionsStrong Metric (Sub)regularity of Karush–Kuhn–Tucker Mappings for Piecewise Linear-Quadratic Convex-Composite Optimization and the Quadratic Convergence of Newton’s MethodExtended Newton Methods for Multiobjective Optimization: Majorizing Function Technique and Convergence AnalysisConvergence properties of a restricted Newton-type method for generalized equations with metrically regular mappingsNewton's method for solving generalized equations without Lipschitz conditionError bounds for approximate solutions of abstract inequality systems and infinite systems of inequalities on Banach spaces