A descent subgradient method using Mifflin's line search for nonsmooth nonconvex optimization
From MaRDI portal
Cites work
- A fast gradient and function sampling method for finite-max functions
- A gradient sampling method based on ideal direction for solving nonsmooth optimization problems
- A new method based on the proximal bundle idea and gradient sampling technique for minimizing nonsmooth convex functions
- A proximal bundle method for nonsmooth nonconvex functions with inexact information
- A quasi-Newton proximal bundle method using gradient sampling technique for minimizing nonsmooth convex functions
- A quasisecant method for minimizing nonsmooth functions
- A redistributed proximal bundle method for nonconvex optimization
- A Robust Gradient Sampling Algorithm for Nonsmooth, Nonconvex Optimization
- A sequential quadratic programming algorithm for nonconvex, nonsmooth constrained optimization
- A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results
- An adaptive gradient sampling algorithm for non-smooth optimization
- An aggregate subgradient method for nonsmooth convex minimization
- An Algorithm for Constrained Optimization with Semismooth Functions
- An effective nonsmooth optimization algorithm for locally Lipschitz functions
- An inexact multiple proximal bundle algorithm for nonsmooth nonconvex multiobjective optimization problems
- Analysis of the gradient method with an Armijo-Wolfe line search on a class of non-smooth convex functions
- Benchmarking optimization software with performance profiles.
- Block Bregman majorization minimization with extrapolation
- Computing proximal points of nonconvex functions
- Convergence of the Gradient Sampling Algorithm for Nonsmooth Nonconvex Optimization
- Convergence of the gradient sampling algorithm on directionally Lipschitz functions
- Convex proximal bundle methods in depth: a unified analysis for inexact oracles
- Cutting plane oracles to minimize non-smooth non-convex functions
- Globally convergent variable metric method for convex nonsmooth unconstrained minimization
- Gobally convergent variable metric method for nonconvex nondifferentiable unconstrained minimization
- Gradient set splitting in nonconvex nonsmooth numerical optimization
- scientific article; zbMATH DE number 410743 (Why is no real title available?)
- scientific article; zbMATH DE number 439380 (Why is no real title available?)
- scientific article; zbMATH DE number 46303 (Why is no real title available?)
- scientific article; zbMATH DE number 53965 (Why is no real title available?)
- scientific article; zbMATH DE number 3559294 (Why is no real title available?)
- scientific article; zbMATH DE number 3577030 (Why is no real title available?)
- scientific article; zbMATH DE number 3894826 (Why is no real title available?)
- Incremental bundle methods using upper models
- Introduction to nonsmooth optimization. Theory, practice and software
- Methods of descent for nondifferentiable optimization
- Minimizers of Cost-Functions Involving Nonsmooth Data-Fidelity Terms. Application to the Processing of Outliers
- Minimizing Nonconvex Nonsmooth Functions via Cutting Planes and Proximity Control
- New limited memory bundle method for large-scale nonsmooth optimization
- New variable-metric algorithms for nondifferentiable optimization problems
- Nonsmooth optimization via quasi-Newton methods
- Numerical optimization. Theoretical and practical aspects. Transl. from the French
- Optimization of lipschitz continuous functions
- Optimizing condition numbers
- Partitional clustering via nonsmooth optimization. Clustering via optimization
- Proximity control in bundle methods for convex nondifferentiable minimization
- Spectral bundle methods for non-convex maximum eigenvalue functions: first-order methods
- Stationarity and superlinear convergence of an algorithm for univariate locally lipschitz constrained minimization
- Subgradient method for nonconvex nonsmooth optimization
- Theory of uniform approximation of functions by polynomials. Transl. from the Russian by Dimitry Malyshev, Peter V. Malyshev and Vladimir V. Gorunovich
- Two numerical methods for optimizing matrix stability
This page was built for publication: A descent subgradient method using Mifflin's line search for nonsmooth nonconvex optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6987157)
