A Gauss-Newton method for convex composite optimization
type: Item
instance of: scholarly article
title: A Gauss-Newton method for convex composite optimization
zbMATH Open document ID: 0846.90083
DOI: 10.1007/BF01585997
author: James V. Burke
author: Michael C. Ferris
published in: Mathematical Programming. Series A. Series B
publication date: 1996-06-02T00:00:00Z
Mathematics Subject Classification ID: 90C25
zbMATH DE Number: 883905
zbMATH Keywords: weak sharp minima
zbMATH Keywords: local quadratic convergence
zbMATH Keywords: Gauss-Newton method
zbMATH Keywords: convex composite optimization
MaRDI profile type: Publication
cites work: A Newton-Raphson method for the solution of systems of equations
cites work: The Convergence of the Ben-Israel Iteration for Nonlinear Least Squares Problems
cites work: Stability and regular points of inequality systems
cites work: Descent methods for composite nondifferentiable optimization problems
cites work: An Exact Penalization Viewpoint of Constrained Optimization
cites work: Weak Sharp Minima in Mathematical Programming
cites work: Optimality conditions for non-finite valued convex composite functions
cites work: A Unified Analysis of Hoffman’s Bound via Fenchel Duality
cites work: Strong uniqueness: A far-reaching criterion for the convergence analysis of iterative procedures
cites work: Q3793938
cites work: Generalized inverse methods for the best least squares solution of systems of non-linear equations
cites work: Q4226179
cites work: A global quadratic algorithm for solving a system of mixed equalities and inequalities
cites work: Strong uniqueness and second order convergence in nonlinear discrete approximation
cites work: A method for the solution of certain non-linear problems in least squares
cites work: Q3908409
cites work: Least-norm linear programming solution as an unconstrained minimization problem
cites work: Normal solutions of linear programs
cites work: The Fritz John necessary optimality conditions in the presence of equality and inequality constraints
cites work: An Algorithm for Least-Squares Estimation of Nonlinear Parameters
cites work: Q5652137
cites work: Strong uniqueness in sequential linear programming
cites work: Q3491338
cites work: Q3334896
cites work: An Embedding Theorem for Spaces of Convex Sets
cites work: Extension of Newton's method to nonlinear functions with values in a cone
cites work: Normed Convex Processes
cites work: Stability Theory for Systems of Inequalities. Part I: Linear Systems
cites work: Regularity and Stability for Convex Multivalued Functions
cites work: Stability Theory for Systems of Inequalities, Part II: Differentiable Nonlinear Systems
cites work: Convex Analysis
cites work: First- and Second-Order Epi-Differentiability in Nonlinear Programming
cites work: Local properties of algorithms for minimizing nonsmooth composite functions
description: scientific article; zbMATH DE number 883905