Local properties of algorithms for minimizing nonsmooth composite functions
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1146103
- Local properties of inexact methods for minimizing nonsmooth composite functions
- On convergence of the Gauss-Newton method for convex composite optimization.
- A Gauss-Newton method for convex composite optimization
- scientific article; zbMATH DE number 1180444
Cites work
- scientific article; zbMATH DE number 3848109 (Why is no real title available?)
- scientific article; zbMATH DE number 3915531 (Why is no real title available?)
- scientific article; zbMATH DE number 3727523 (Why is no real title available?)
- scientific article; zbMATH DE number 3744430 (Why is no real title available?)
- A Characterization of Superlinear Convergence and Its Application to Quasi-Newton Methods
- A Projected Lagrangian Algorithm for Nonlinear l₁ Optimization
- A Projected Lagrangian Algorithm for Nonlinear Minimax Optimization
- A note on the computation of an orthonormal basis for the null space of a matrix
- An Example of Only Linear Convergence of Trust Region Algorithms for Non-smooth Optimization
- An algorithm for composite nonsmooth optimization problems
- Conditions for Superlinear Convergence in l1 and l Solutions of Overdetermined Non-linear Equations
- Local properties of algorithms for minimizing nonsmooth composite functions
- Nonlinear programming via an exact penalty function: Asymptotic analysis
- On the Local Convergence of Quasi-Newton Methods for 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 watchdog technique for forcing convergence in algorithms for constrained optimization
Cited in
(33)- Composite proximal bundle method
- Characterizations of asymptotic cone of the solution set of a composite convex optimization problem
- Second order necessary and sufficient conditions for convex composite NDO
- A trust region algorithm for minimization of locally Lipschitzian functions
- Local properties of algorithms for minimizing nonsmooth composite functions
- Strong KKT conditions and weak sharp solutions in convex-composite optimization
- A successive quadratic programming method for a class of constrained nonsmooth optimization problems
- On convergence rates of linearized proximal algorithms for convex composite optimization with applications
- Efficiency of higher-order algorithms for minimizing composite functions
- A trust region algorithm for nonsmooth optimization
- Discontinuous piecewise linear optimization
- An inexact algorithm for composite nondifferentiable optimization
- Local properties of inexact methods for minimizing nonsmooth composite functions
- Gauss-Newton method for convex composite optimizations on Riemannian manifolds
- Convergence analysis of the Gauss-Newton method for convex inclusion and convex-composite optimization problems
- Weak sharp efficiency in multiobjective optimization
- Two-square theorems for infinite matrices on certain fields
- Unification of basic and composite nondifferentiable optimization
- Local and global behavior for algorithms of solving equations
- Convergence analysis of a proximal Gauss-Newton method
- Convergence of linearized proximal algorithms with adaptive stepsizes for convex composite optimization
- Descent algorithm for a class of convex nondifferentiable functions
- A Gauss-Newton method for convex composite optimization
- Metric subregularity for composite-convex generalized equations in Banach spaces
- Asymptotic analysis in convex composite multiobjective optimization problems
- Uniform convergence of higher order quasi Hermite-Fejér interpolation
- Global convergence of a semi-infinite optimization method
- Uniform subsmoothness and linear regularity for a collection of infinitely many closed sets
- Nonlinear programming and nonsmooth optimization by successive linear programming
- Linearized proximal algorithms with adaptive stepsizes for convex composite optimization with applications
- Sharp minima for multiobjective optimization in Banach spaces
- Strong metric (sub)regularity of Karush-Kuhn-Tucker mappings for piecewise linear-quadratic convex-composite optimization and the quadratic convergence of Newton's method
- Riemannian linearized proximal algorithms for nonnegative inverse eigenvalue problem
This page was built for publication: Local properties of algorithms for minimizing nonsmooth composite functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3688120)
