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