A generalized proximal point algorithm for certain non-convex minimization problems
From MaRDI portal
Publication:3920554
DOI10.1080/00207728108963798zbMath0467.65028OpenAlexW2048742402MaRDI QIDQ3920554
Publication date: 1981
Published in: International Journal of Systems Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207728108963798
Numerical mathematical programming methods (65K05) Convex programming (90C25) Nonlinear programming (90C30)
Related Items
A Trust-region Method for Nonsmooth Nonconvex Optimization, On inexact stochastic splitting methods for a class of nonconvex composite optimization problems with relative error, A new approach to the proximal point method: convergence on general Riemannian manifolds, Proximal point methods for Lipschitz functions on Hadamard manifolds: scalar and vectorial cases, Block-coordinate and incremental aggregated proximal gradient methods for nonsmooth nonconvex problems, A proximal method for composite minimization, Second order semi-smooth proximal Newton methods in Hilbert spaces, New results on subgradient methods for strongly convex optimization problems with a unified analysis, Global Convergence of Splitting Methods for Nonconvex Composite Optimization, Sequential threshold control in descent splitting methods for decomposable optimization problems, Structured Sparsity: Discrete and Convex Approaches, A simplified view of first order methods for optimization, The developments of proximal point algorithms, A parallel descent algorithm for convex programming, Gradient methods for minimizing composite functions, Combined partial regularization and descent method for a generalized primal-dual system, Iterative Method for Non-Stationary Mixed Variational Inequalities, First Order Methods Beyond Convexity and Lipschitz Gradient Continuity with Applications to Quadratic Inverse Problems, On the linear convergence of a Bregman proximal point algorithm, Approximation accuracy, gradient methods, and error bound for structured convex optimization, The convex geometry of linear inverse problems, A New Boosted Proximal Point Algorithm for Minimizing Nonsmooth DC Functions, Combined methods for dynamic spatial auction market models, A simple convergence analysis of Bregman proximal gradient algorithm, The boosted DC algorithm for linearly constrained DC programming, Convergence Analysis of the Proximal Gradient Method in the Presence of the Kurdyka–Łojasiewicz Property Without Global Lipschitz Assumptions, Proximal variable metric method with spectral diagonal update for large scale sparse optimization, Two-level iterative method for non-stationary mixed variational inequalities, Inexact proximal DC Newton-type method for nonconvex composite functions, A globally convergent proximal Newton-type method in nonsmooth convex optimization, Smoothing accelerated proximal gradient method with fast convergence rate for nonsmooth convex optimization beyond differentiability, A proximal trust-region method for nonsmooth optimization with inexact function and gradient evaluations, A Nonlocal Graph-PDE and Higher-Order Geometric Integration for Image Labeling, Convergence rates analysis of a multiobjective proximal gradient method, Proximal gradient method with extrapolation and line search for a class of non-convex and non-smooth problems, Fast projections onto mixed-norm balls with applications, MONOTONICITY FOR MULTIOBJECTIVE ACCELERATED PROXIMAL GRADIENT METHODS, Proximal stochastic recursive momentum algorithm for nonsmooth nonconvex optimization problems, Open issues and recent advances in DC programming and DCA, Interior proximal methods for quasiconvex optimization, Global optimization for non-convex programs via convex proximal point method, Unnamed Item, A successive quadratic programming method for a class of constrained nonsmooth optimization problems, A generalized inexact proximal point method for nonsmooth functions that satisfies Kurdyka Łojasiewicz inequality, On the optimal linear convergence rate of a generalized proximal point algorithm, Proximal point method for a special class of nonconvex multiobjective optimization functions, Accelerating the DC algorithm for smooth functions, Conditions for the existence, identification and calculus rules of the threshold of prox-boundedness, A coordinate gradient descent method for nonsmooth separable minimization, Incrementally updated gradient methods for constrained and regularized optimization, IMRO: A Proximal Quasi-Newton Method for Solving $\ell_1$-Regularized Least Squares Problems, Templates for convex cone problems with applications to sparse signal recovery, An introduction to continuous optimization for imaging, Nonsymmetric proximal point algorithm with moving proximal centers for variational inequalities: convergence analysis, A proximal gradient descent method for the extended second-order cone linear complementarity problem, A sequential partial linearization algorithm for the symmetric eigenvalue complementarity problem, 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, Block-coordinate gradient descent method for linearly constrained nonsmooth separable optimization, The Boosted Difference of Convex Functions Algorithm for Nonsmooth Functions, A family of subgradient-based methods for convex optimization problems in a unifying framework, Generalized Conditional Gradient for Sparse Estimation, A Stochastic Semismooth Newton Method for Nonsmooth Nonconvex Optimization, On the linear convergence rate of a relaxed forward–backward splitting method, A Bregman Forward-Backward Linesearch Algorithm for Nonconvex Composite Optimization: Superlinear Convergence to Nonisolated Local Minima, Numerical solution of an inverse random source problem for the time fractional diffusion equation via PhaseLift, A dual Bregman proximal gradient method for relatively-strongly convex optimization, Convergence properties of monotone and nonmonotone proximal gradient methods revisited, Extensions of Dinkelbach's algorithm for solving nonlinear fractional programming problems, Similarity preserving low-rank representation for enhanced data representation and effective subspace learning, A method for minimizing the sum of a convex function and a continuously differentiable function, Complex-Valued Imaging with Total Variation Regularization: An Application to Full-Waveform Inversion in Visco-acoustic Media, Learnable Descent Algorithm for Nonsmooth Nonconvex Image Reconstruction, Efficient Boosted DC Algorithm for Nonconvex Image Restoration with Rician Noise, Extrapolated smoothing descent algorithm for constrained nonconvex and nonsmooth composite problems, Partial linearization methods in nonlinear programming, Nomonotone spectral gradient method for sparse recovery, Submonotone mappings and the proximal point algorithm
Cites Work
