A semismooth conjugate gradients method – theoretical analysis
From MaRDI portal
Publication:6641012
Cites work
- scientific article; zbMATH DE number 410743 (Why is no real title available?)
- scientific article; zbMATH DE number 3843083 (Why is no real title available?)
- scientific article; zbMATH DE number 46303 (Why is no real title available?)
- scientific article; zbMATH DE number 3526471 (Why is no real title available?)
- scientific article; zbMATH DE number 3577030 (Why is no real title available?)
- scientific article; zbMATH DE number 2133301 (Why is no real title available?)
- scientific article; zbMATH DE number 854122 (Why is no real title available?)
- scientific article; zbMATH DE number 5060482 (Why is no real title available?)
- A nonsmooth trust-region method for locally Lipschitz functions with application to optimization problems constrained by variational inequalities
- A proximal method for composite minimization
- Breakdown points of affine equivariant estimators of multivariate location and covariance matrices
- Characterizing and testing subdifferential regularity in piecewise smooth optimization
- Deep learning
- Descent Property and Global Convergence of the Fletcher—Reeves Method with Inexact Line Search
- Evaluating Derivatives
- Evaluating an element of the Clarke generalized Jacobian of a composite piecewise differentiable function
- Finite convergence of an active signature method to local minima of piecewise linear functions
- Function minimization by conjugate gradients
- Introduction to Piecewise Differentiable Equations
- Introduction to nonsmooth optimization. Theory, practice and software
- Methods of conjugate gradients for solving linear systems
- Minimal Residual Method Stronger than Polynomial Preconditioning
- Nonlinear total variation based noise removal algorithms
- Nonsmooth optimization via quasi-Newton methods
- On Lipschitz optimization based on gray-box piecewise linearization
- On concepts of directional differentiability
- On the method of shortest residuals for unconstrained optimization
- Optimization for data analysis
- Optimization of lipschitz continuous functions
- Partitional clustering via nonsmooth optimization. Clustering via optimization
- Semismooth and Semiconvex Functions in Constrained Optimization
- Sensitivity Analysis of Nonlinear Programs and Differentiability Properties of Metric Projections
- Some methods of speeding up the convergence of iteration methods
- Strong semismoothness of the Fischer-Burmeister SDC and SOC complementarity functions
- Subgradient optimization in nonsmooth optimization (including the soviet revolution)
- The Split Bregman Method for L1-Regularized Problems
This page was built for publication: A semismooth conjugate gradients method – theoretical analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6641012)
