Inexact reduced gradient methods in nonconvex optimization
From MaRDI portal
Recommendations
- An inexact proximal gradient algorithm with extrapolation for a class of nonconvex nonsmooth optimization problems
- On the convergence of a linesearch based proximal-gradient method for nonconvex optimization
- A nonlinear conjugate gradient method using inexact first-order information
- General inertial proximal gradient method for a class of nonconvex nonsmooth optimization problems
- A redistributed proximal bundle method for nonsmooth nonconvex functions with inexact information
Cites work
- scientific article; zbMATH DE number 3871041 (Why is no real title available?)
- scientific article; zbMATH DE number 3352737 (Why is no real title available?)
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A descent lemma beyond Lipschitz gradient continuity: first-order methods revisited and applications
- A frequency-domain analysis of inexact gradient methods
- A global optimization method for the design of space trajectories
- A literature survey of benchmark functions for global optimisation problems
- A nonderivative version of the gradient sampling algorithm for nonsmooth nonconvex optimization
- Accelerated gradient methods with absolute and relative noise in the gradient
- Accelerating the DC algorithm for smooth functions
- An Implicit Filtering Algorithm for Optimization of Functions with Many Local Minima
- Convergence Properties of the Inexact Levenberg-Marquardt Method under Local Error Bound Conditions
- Convergence of non-smooth descent methods using the Kurdyka-Łojasiewicz inequality
- Convergence of the Gradient Sampling Algorithm for Nonsmooth Nonconvex Optimization
- Convergence of the Iterates of Descent Methods for Analytic Cost Functions
- Convergence of the gradient sampling algorithm on directionally Lipschitz functions
- Convex analysis and monotone operator theory in Hilbert spaces
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- First-order methods in optimization
- First-order methods of smooth convex optimization with inexact oracle
- Forward-backward quasi-Newton methods for nonsmooth optimization problems
- Generalized damped Newton algorithms in nonsmooth optimization via second-order subdifferentials
- Globally convergent coderivative-based generalized Newton methods in nonsmooth optimization
- Gradient methods of maximization
- Improved convergence result for the discrete gradient and secant methods for nonsmooth optimization
- Least Absolute Deviations Curve-Fitting
- Lectures on convex optimization
- Local linear convergence for alternating and averaged nonconvex projections
- Monotone Operators and the Proximal Point Algorithm
- Newton-Type Methods for Optimization and Variational Problems
- Nonlinear programming
- On gradients of functions definable in o-minimal structures
- On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
- Optimization methods for large-scale machine learning
- Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
- The method of steepest descent for non-linear minimization problems
- The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems
- Universal gradient methods for convex optimization problems
- Variational Analysis
Cited in
(7)- Inexact Riemannian gradient descent method for nonconvex optimization with strong convergence
- Inexact proximal methods for weakly convex functions
- Multiblock ADMM for nonsmooth nonconvex optimization with nonlinear coupling constraints
- Local convergence analysis for nonisolated solutions to derivative-free methods of optimization
- Convergence of first-order algorithms with momentum from the perspective of an inexact gradient descent method
- Local minimizers of nonconvex functions in Banach spaces via Moreau envelopes
- Convergence of descent optimization algorithms under Polyak-Łojasiewicz-Kurdyka conditions
This page was built for publication: Inexact reduced gradient methods in nonconvex optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6655782)
