Local properties of inexact methods for minimizing nonsmooth composite functions

DOI10.1007/BF02591697MaRDI QIDQ3760305zbMATH OpenFDO

Authors Stephen J. Wright

Publication date 1987

Published in Mathematical Programming (Search for Journal in Brave)

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

zbMATH Keywords

nonsmooth optimizationpolyhedral convex functionsactive setcomposite functionsstrong uniquenessminimax functionscomposite nondifferentiable functionsequality-constrained quadratic programming

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Nonlinear programming (90C30)

Recommendations

• Local properties of algorithms for minimizing nonsmooth composite functions
• An inexact algorithm for composite nondifferentiable optimization
• scientific article; zbMATH DE number 1323073
• scientific article; zbMATH DE number 1180444
• Convergence of an Inexact Algorithm for Composite Nonsmooth Optimization

Cites work

• scientific article; zbMATH DE number 3934327 (Why is no real title available?)
• scientific article; zbMATH DE number 3744430 (Why is no real title available?)
• A Projected Lagrangian Algorithm for Nonlinear l₁ Optimization
• A Projected Lagrangian Algorithm for Nonlinear Minimax Optimization
• An Example of Only Linear Convergence of Trust Region Algorithms for Non-smooth Optimization
• Diagonalized multiplier methods and quasi-Newton methods for constrained optimization
• Discrete, non-linear approximation problems in polyhedral norms
• Discrete, nonlinear approximation problems in polyhedral norms: A Levenberg-like algorithm
• Inexact Newton Methods
• Local properties of algorithms for minimizing nonsmooth composite functions
• Newton's method for constrained optimization
• Optimality conditions for piecewise smooth functions
• Projected Hessian Updating Algorithms for Nonlinearly Constrained Optimization
• Strong uniqueness and second order convergence in nonlinear discrete approximation
• Strong uniqueness: A far-reaching criterion for the convergence analysis of iterative procedures
• The Minimax Solution of an Overdetermined System of Non-linear Equations
• Truncated-Newton algorithms for large-scale unconstrained optimization

Cited in

(5)

• Local properties of algorithms for minimizing nonsmooth composite functions
• An inexact algorithm for composite nondifferentiable optimization
• Perturbed steepest-descent technique in multiextremal problems
• Strong metric (sub)regularity of Karush-Kuhn-Tucker mappings for piecewise linear-quadratic convex-composite optimization and the quadratic convergence of Newton's method
• A study of convex convex-composite functions via infimal convolution with applications

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3760305)