A generalized proximal point algorithm for certain non-convex minimization problems
From MaRDI portal
Publication:3920554
Cites work
Cited in
(84)- Convergence properties of monotone and nonmonotone proximal gradient methods revisited
- A Trust-region Method for Nonsmooth Nonconvex Optimization
- Partial linearization methods in nonlinear programming
- Accelerating the DC algorithm for smooth functions
- A proximal gradient descent method for the extended second-order cone linear complementarity problem
- Proximal point methods for Lipschitz functions on Hadamard manifolds: scalar and vectorial cases
- Similarity preserving low-rank representation for enhanced data representation and effective subspace learning
- Approximation accuracy, gradient methods, and error bound for structured convex optimization
- Global convergence of splitting methods for nonconvex composite optimization
- Efficient Boosted DC Algorithm for Nonconvex Image Restoration with Rician Noise
- Second order semi-smooth proximal Newton methods in Hilbert spaces
- A method for minimizing the sum of a convex function and a continuously differentiable function
- A coordinate gradient descent method for nonsmooth separable minimization
- A globally convergent proximal Newton-type method in nonsmooth convex optimization
- Complex-Valued Imaging with Total Variation Regularization: An Application to Full-Waveform Inversion in Visco-acoustic Media
- The convex geometry of linear inverse problems
- A generalized inexact proximal point method for nonsmooth functions that satisfies Kurdyka Łojasiewicz inequality
- Submonotone mappings and the proximal point algorithm
- Two-level iterative method for non-stationary mixed variational inequalities
- A proximal method for composite minimization
- The Boosted Difference of Convex Functions Algorithm for Nonsmooth Functions
- On the optimal linear convergence rate of a generalized proximal point algorithm
- Generalized conditional gradient for sparse estimation
- A new approach to the proximal point method: convergence on general Riemannian manifolds
- A Bregman forward-backward linesearch algorithm for nonconvex composite optimization: superlinear convergence to nonisolated local minima
- A family of subgradient-based methods for convex optimization problems in a unifying framework
- First order methods beyond convexity and Lipschitz gradient continuity with applications to quadratic inverse problems
- Inexact proximal memoryless quasi-Newton methods based on the Broyden family for minimizing composite functions
- Globalized inexact proximal Newton-type methods for nonconvex composite functions
- Extrapolated smoothing descent algorithm for constrained nonconvex and nonsmooth composite problems
- Sequential threshold control in descent splitting methods for decomposable optimization problems
- A simplified view of first order methods for optimization
- Combined methods for dynamic spatial auction market models
- Gradient methods for minimizing composite functions
- Fast projections onto mixed-norm balls with applications
- An introduction to continuous optimization for imaging
- A simple convergence analysis of Bregman proximal gradient algorithm
- Combined partial regularization and descent method for a generalized primal-dual system
- A sequential partial linearization algorithm for the symmetric eigenvalue complementarity problem
- Smoothing accelerated proximal gradient method with fast convergence rate for nonsmooth convex optimization beyond differentiability
- Learnable descent algorithm for nonsmooth nonconvex image reconstruction
- Numerical solution of an inverse random source problem for the time fractional diffusion equation via PhaseLift
- Interior proximal methods for quasiconvex optimization
- Extensions of Dinkelbach's algorithm for solving nonlinear fractional programming problems
- Nomonotone spectral gradient method for sparse recovery
- IMRO: A proximal quasi-Newton method for solving \(\ell_1\)-regularized least squares problems
- Structured sparsity: discrete and convex approaches
- On the linear convergence rate of a relaxed forward–backward splitting method
- New results on subgradient methods for strongly convex optimization problems with a unified analysis
- Templates for convex cone problems with applications to sparse signal recovery
- A stochastic semismooth Newton method for nonsmooth nonconvex optimization
- The boosted DC algorithm for linearly constrained DC programming
- Iterative Method for Non-Stationary Mixed Variational Inequalities
- A parallel descent algorithm for convex programming
- Block-coordinate and incremental aggregated proximal gradient methods for nonsmooth nonconvex problems
- Block-coordinate gradient descent method for linearly constrained nonsmooth separable optimization
- Nonsymmetric proximal point algorithm with moving proximal centers for variational inequalities: convergence analysis
- Incrementally updated gradient methods for constrained and regularized optimization
- The developments of proximal point algorithms
- Proximal point method for a special class of nonconvex multiobjective optimization functions
- A successive quadratic programming method for a class of constrained nonsmooth optimization problems
- Conditions for the existence, identification and calculus rules of the threshold of prox-boundedness
- A dual Bregman proximal gradient method for relatively-strongly convex optimization
- A Levenberg-Marquardt method for nonsmooth regularized least squares
- A proximal trust-region method for nonsmooth optimization with inexact function and gradient evaluations
- On inexact stochastic splitting methods for a class of nonconvex composite optimization problems with relative error
- Proximal gradient method with extrapolation and line search for a class of non-convex and non-smooth problems
- A new boosted proximal point algorithm for minimizing nonsmooth DC functions
- Convergence Analysis of the Proximal Gradient Method in the Presence of the Kurdyka–Łojasiewicz Property Without Global Lipschitz Assumptions
- Convergence rates analysis of a multiobjective proximal gradient method
- Open issues and recent advances in DC programming and DCA
- Global optimization for non-convex programs via convex proximal point method
- Proximal gradient methods beyond monotony
- Partial regularization and descent method for a extended primal-dual system
- New merit functions for multiobjective optimization and their properties
- MONOTONICITY FOR MULTIOBJECTIVE ACCELERATED PROXIMAL GRADIENT METHODS
- Proximal stochastic recursive momentum algorithm for nonsmooth nonconvex optimization problems
- An inexact regularized proximal Newton method without line search
- Proximal variable metric method with spectral diagonal update for large scale sparse optimization
- A Nonlocal Graph-PDE and Higher-Order Geometric Integration for Image Labeling
- Inexact proximal DC Newton-type method for nonconvex composite functions
- On the linear convergence of a Bregman proximal point algorithm
- Approximate Bregman proximal gradient algorithm for relatively smooth nonconvex optimization
- MGProx: a nonsmooth multigrid proximal gradient method with adaptive restriction for strongly convex optimization
This page was built for publication: A generalized proximal point algorithm for certain non-convex minimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3920554)
