Local properties of algorithms for minimizing nonsmooth composite functions

DOI10.1007/BF01585659zbMath0571.90084MaRDI QIDQ3688120

No author found.

Publication date: 1985

Published in: Mathematical Programming (Search for Journal in Brave)

zbMATH Keywords

rate of convergencenonsmooth optimizationlocal convergencesecond order convergencecomposite functionstrong uniquenessgeneralized Gauss-Newton methodreduced curvaturestructure functionalstwo- step superlinear rate

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37)

Related Items (31)

Uniform convergence of higher order quasi Hermite-Fejér interpolation ⋮ Two-square theorems for infinite matrices on certain fields ⋮ A trust region algorithm for minimization of locally Lipschitzian functions ⋮ A trust region algorithm for nonsmooth optimization ⋮ Weak sharp efficiency in multiobjective optimization ⋮ Sharp minima for multiobjective optimization in Banach spaces ⋮ A Gauss-Newton method for convex composite optimization ⋮ Composite proximal bundle method ⋮ Discontinuous piecewise linear optimization ⋮ Unification of basic and composite nondifferentiable optimization ⋮ Local properties of inexact methods for minimizing nonsmooth composite functions ⋮ Convergence analysis of a proximal Gauss-Newton method ⋮ Strong KKT conditions and weak sharp solutions in convex-composite optimization ⋮ Riemannian linearized proximal algorithms for nonnegative inverse eigenvalue problem ⋮ Asymptotic analysis in convex composite multiobjective optimization problems ⋮ Second order necessary and sufficient conditions for convex composite NDO ⋮ Linearized proximal algorithms with adaptive stepsizes for convex composite optimization with applications ⋮ Global convergence of a semi-infinite optimization method ⋮ Gauss-Newton method for convex composite optimizations on Riemannian manifolds ⋮ Local and global behavior for algorithms of solving equations ⋮ A successive quadratic programming method for a class of constrained nonsmooth optimization problems ⋮ Convergence analysis of the Gauss-Newton method for convex inclusion and convex-composite optimization problems ⋮ Metric subregularity for composite-convex generalized equations in Banach spaces ⋮ Characterizations of asymptotic cone of the solution set of a composite convex optimization problem ⋮ Uniform subsmoothness and linear regularity for a collection of infinitely many closed sets ⋮ Nonlinear programming and nonsmooth optimization by successive linear programming ⋮ On Convergence Rates of Linearized Proximal Algorithms for Convex Composite Optimization with Applications ⋮ Strong Metric (Sub)regularity of Karush–Kuhn–Tucker Mappings for Piecewise Linear-Quadratic Convex-Composite Optimization and the Quadratic Convergence of Newton’s Method ⋮ An inexact algorithm for composite nondifferentiable optimization ⋮ Local properties of algorithms for minimizing nonsmooth composite functions ⋮ Descent algorithm for a class of convex nondifferentiable functions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An algorithm for composite nonsmooth optimization problems
• Strong uniqueness and second order convergence in nonlinear discrete approximation
• Strong uniqueness: A far-reaching criterion for the convergence analysis of iterative procedures
• An Example of Only Linear Convergence of Trust Region Algorithms for Non-smooth Optimization
• A note on the computation of an orthonormal basis for the null space of a matrix
• Conditions for Superlinear Convergence in l1 and l  Solutions of Overdetermined Non-linear Equations
• Local properties of algorithms for minimizing nonsmooth composite functions
• A Projected Lagrangian Algorithm for Nonlinear Minimax Optimization
• A Projected Lagrangian Algorithm for Nonlinear $l_1 $ Optimization
• The watchdog technique for forcing convergence in algorithms for constrained optimization
• On the Local Convergence of Quasi-Newton Methods for Constrained Optimization
• Nonlinear programming via an exact penalty function: Asymptotic analysis
• A Characterization of Superlinear Convergence and Its Application to Quasi-Newton Methods

This page was built for publication: Local properties of algorithms for minimizing nonsmooth composite functions