Proximal point methods and nonconvex optimization
From MaRDI portal
Publication:1281479
DOI10.1023/A:1008321423879zbMath0916.90224OpenAlexW1512226162MaRDI QIDQ1281479
Alexander Kaplan, Rainer Tichatschke
Publication date: 22 March 1999
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1008321423879
necessary optimality conditionsregularizationnonconvex problemsill-posed problemsproximal point method
Related Items (47)
A new approach to the proximal point method: convergence on general Riemannian manifolds ⋮ An algorithmic approach to prox-regular variational inequalities ⋮ An abstract proximal point algorithm ⋮ Stochastic backward Euler: an implicit gradient descent algorithm for \(k\)-means clustering ⋮ A proximal method for composite minimization ⋮ DYNAMICAL ADJUSTMENT OF THE PROX-PARAMETER IN BUNDLE METHODS ⋮ An inexact proximal method for quasiconvex minimization ⋮ A combined dictionary learning and TV model for image restoration with convergence analysis ⋮ Full convergence of the proximal point method for quasiconvex functions on Hadamard manifolds ⋮ Global convergence of a proximal linearized algorithm for difference of convex functions ⋮ A generalized proximal linearized algorithm for DC functions with application to the optimal size of the firm problem ⋮ Extended auxiliary problem principle to variational inequalities involving multi-valued operators ⋮ Proximal methods in reflexive Banach spaces without monotonicity ⋮ A regularization interpretation of the proximal point method for weakly convex functions ⋮ Forward-Backward Envelope for the Sum of Two Nonconvex Functions: Further Properties and Nonmonotone Linesearch Algorithms ⋮ An inexact scalarization proximal point method for multiobjective quasiconvex minimization ⋮ An effective nonsmooth optimization algorithm for locally Lipschitz functions ⋮ Relaxed-inertial proximal point type algorithms for quasiconvex minimization ⋮ Bregman proximal point type algorithms for quasiconvex minimization ⋮ Interior proximal methods for quasiconvex optimization ⋮ Global optimization for non-convex programs via convex proximal point method ⋮ The proximal point algorithm for pseudomonotone variational inequalities on Hadamard manifolds ⋮ Proximal point method for minimizing quasiconvex locally Lipschitz functions on Hadamard manifolds ⋮ Proximal point method for locally Lipschitz functions in multiobjective optimization of Hadamard manifolds ⋮ A generalized inexact proximal point method for nonsmooth functions that satisfies Kurdyka Łojasiewicz inequality ⋮ A proximal alternating direction method of multipliers for a minimization problem with nonconvex constraints ⋮ Proximal point method for a special class of nonconvex multiobjective optimization functions ⋮ Approximate versions of proximal iteratively reweighted algorithms including an extended IP-ICMM for signal and image processing problems ⋮ DC programming and DCA: thirty years of developments ⋮ Conditions for the existence, identification and calculus rules of the threshold of prox-boundedness ⋮ On the convergence of the proximal algorithm for nonsmooth functions involving analytic features ⋮ Self-adaptive inexact proximal point methods ⋮ A Lyusternik-Graves theorem for the proximal point method ⋮ Local convergence of the proximal point method for a special class of nonconvex functions on Hadamard manifolds ⋮ Inexact Proximal Point Methods for Equilibrium Problems in Banach Spaces ⋮ On the proximal point method for equilibrium problems in Hilbert spaces ⋮ About proximal-type methods for a class of nonmonotone operators ⋮ Inexact Newton and quasi-Newton methods for the output feedback pole assignment problem ⋮ Modified proximal point algorithms on Hadamard manifolds ⋮ An inexact proximal point method for solving generalized fractional programs ⋮ Proximal point method for a special class of nonconvex functions on Hadamard manifolds ⋮ Inexact proximal point methods in metric spaces ⋮ Asymptotic convergence of an inertial proximal method for unconstrained quasiconvex minimization ⋮ Two new customized proximal point algorithms without relaxation for linearly constrained convex optimization ⋮ Minimization of non-smooth, non-convex functionals by iterative thresholding ⋮ A proximal algorithm with quasi distance. Application to habit's formation ⋮ A reduced proximal-point homotopy method for large-scale non-convex BQP
This page was built for publication: Proximal point methods and nonconvex optimization
