Computing proximal points of nonconvex functions
From MaRDI portal
From authors' abstract: The proximal point mapping is the basis of many optimization techniques for convex functions. By means of variational analysis, the concept of proximal mappings was recently extended to nonconvex functions that are prox-regular and prox-bounded. In such a setting, the proximal point mapping is locally Lipschitz continuous and its set of fixed points coincide with the critical points of the original function. This suggests that the many uses of proximal points, and their corresponding proximal envelopes (Moreau envelopes), will have a natural extension from convex optimization to nonconvex optimization. For example, the inexact proximal point methods for convex optimization might be redesigned to work for nonconvex functions. In order to begin the practical implementation of proximal points in a nonconvex setting, a first crucial step would be to design efficient methods of approximating nonconvex proximal points. This would provide a solid foundation on which future design and analysis for nonconvex proximal point methods could flourish. In this paper we present a methodology based on the computation of proximal points of piecewise affine models of the nonconvex function. These models can be built with only the knowledge obtained from a black box providing, for each point, the function value and one subgradient. Convergence of the method is proved for the class of nonconvex functions that are prox-bounded and lower-\(C^2\) and encouraging preliminary numerical testing is reported.
Recommendations
- Proximal point methods and nonconvex optimization
- Computing proximal points of convex functions with inexact subgradients
- Non-Convex feasibility problems and proximal point methods
- Proximal point algorithms for nonsmooth convex optimization with fixed point constraints
- Proximal determination of convex functions
- Proximal point algorithms and generalized nonlinear variational problems
- Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming
- Proximal point algorithms for zero points of nonlinear operators
- Proximal point nonlinear rescaling method for convex optimization
- A proximal iterative approach to a non-convex optimization problem
Cites work
- A bundle-Newton method for nonsmooth unconstrained minimization
- A family of variable metric proximal methods
- A Method for Solving Certain Quadratic Programming Problems Arising in Nonsmooth Optimization
- A modification and an extension of Lemarechal’s algorithm for nonsmooth minimization
- An interior-proximal method for convex linearly constrained problems and its extension to variational inequalities
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- Benchmarking optimization software with performance profiles.
- Convergence of some algorithms for convex minimization
- Coupling General Penalty Schemes for Convex Programming with the Steepest Descent and the Proximal Point Algorithm
- Exact penalty functions in proximal bundle methods for constrained convex nondifferentiable minimization
- Generalized Hessian Properties of Regularized Nonsmooth Functions
- Gobally convergent variable metric method for nonconvex nondifferentiable unconstrained minimization
- scientific article; zbMATH DE number 3846333 (Why is no real title available?)
- scientific article; zbMATH DE number 3791548 (Why is no real title available?)
- scientific article; zbMATH DE number 2155014 (Why is no real title available?)
- scientific article; zbMATH DE number 3237318 (Why is no real title available?)
- scientific article; zbMATH DE number 3244852 (Why is no real title available?)
- Maximum principle in the problem of time optimal response with nonsmooth constraints
- Minimizing Nonconvex Nonsmooth Functions via Cutting Planes and Proximity Control
- Monotone Operators and the Proximal Point Algorithm
- New Proximal Point Algorithms for Convex Minimization
- Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming
- Numerical methods for nondifferentiable convex optimization
- Penalty-proximal methods in convex programming
- Primal-Dual Gradient Structured Functions: Second-Order Results; Links to Epi-Derivatives and Partly Smooth Functions
- Prox-regular functions in Hilbert spaces
- Prox-regular functions in variational analysis
- Prox-regularity of functions and sets in Banach spaces
- Proximité et dualité dans un espace hilbertien
- Semismooth and Semiconvex Functions in Constrained Optimization
- Solving semidefinite quadratic problems within nonsmooth optimization algorithms
- Variable metric bundle methods: From conceptual to implementable forms
- 𝒱𝒰-smoothness and proximal point results for some nonconvex functions
Cited in
(76)- A proximal iterative approach to a non-convex optimization problem
- Proximal point methods and nonconvex optimization
- An approximate redistributed proximal bundle method with inexact data for minimizing nonsmooth nonconvex functions
- A proximal bundle method for constrained nonsmooth nonconvex optimization with inexact information
- An infeasible bundle method for nonconvex constrained optimization with application to semi-infinite programming problems
- An effective nonsmooth optimization algorithm for locally Lipschitz functions
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- A decomposition method with redistributed subroutine for constrained nonconvex optimization
- Conditions for the existence, identification and calculus rules of the threshold of prox-boundedness
- A new infeasible proximal bundle algorithm for nonsmooth nonconvex constrained optimization
- Proximal point algorithms for zero points of nonlinear operators
- A filter proximal bundle method for nonsmooth nonconvex constrained optimization
- An alternating linearization bundle method for a class of nonconvex optimization problem with inexact information
- Solving mixed variational inequalities beyond convexity
- An extension of the proximal point algorithm beyond convexity
- On strongly quasiconvex functions: existence results and proximal point algorithms
- A generalized proximal linearized algorithm for DC functions with application to the optimal size of the firm problem
- Derivative-free optimization via proximal point methods
- On convex envelopes and regularization of non-convex functionals without moving global minima
- Derivative-free robust optimization by outer approximations
- Nonsmooth and nonconvex optimization via approximate difference-of-convex decompositions
- Minimization of non-smooth, non-convex functionals by iterative thresholding
- Piecewise linear approximations in nonconvex nonsmooth optimization
- Computing proximal points of convex functions with inexact subgradients
- Inexact Newton and quasi-Newton methods for the output feedback pole assignment problem
- Combination of steepest descent and BFGS methods for nonconvex nonsmooth optimization
- A proximal alternating linearization method for nonconvex optimization problems
- Joint estimation and variable selection for mean and dispersion in proper dispersion models
- Nonconvex bundle method with application to a delamination problem
- Global convergence of a proximal linearized algorithm for difference of convex functions
- Benchmark of some nonsmooth optimization solvers for computing nonconvex proximal points
- Global convergence of splitting methods for nonconvex composite optimization
- Optimality, identifiability, and sensitivity
- Non-Convex feasibility problems and proximal point methods
- Constrained nonconvex nonsmooth optimization via proximal bundle method
- Proximal point method for a special class of nonconvex functions on Hadamard manifolds
- Active-set Newton methods and partial smoothness
- Characterizing firm nonexpansiveness of prox mappings both locally and globally
- Optimization conditions and decomposable algorithms for convertible nonconvex optimization
- Partial smoothness and constant rank
- A proximal quasi-Newton trust-region method for nonsmooth regularized optimization
- Trimmed statistical estimation via variance reduction
- The proximal alternating direction method of multipliers in the nonconvex setting: convergence analysis and rates
- Minimizing Piecewise-Concave Functions Over Polyhedra
- A Proximal Minimization Algorithm for Structured Nonconvex and Nonsmooth Problems
- Proximally guided stochastic subgradient method for nonsmooth, nonconvex problems
- A splitting bundle approach for non-smooth non-convex minimization
- Algorithmic Applications in Management
- One-Step Estimation with Scaled Proximal Methods
- A Unified Analysis of Descent Sequences in Weakly Convex Optimization, Including Convergence Rates for Bundle Methods
- Newton acceleration on manifolds identified by proximal gradient methods
- Harnessing Structure in Composite Nonsmooth Minimization
- A redistributed proximal bundle method for nonsmooth nonconvex functions with inexact information
- Two-step inertial forward-reflected-backward splitting based algorithm for nonconvex mixed variational inequalities
- Proximal variable metric method with spectral diagonal update for large scale sparse optimization
- scientific article; zbMATH DE number 7733428 (Why is no real title available?)
- A proximal bundle method for a class of nonconvex nonsmooth composite optimization problems
- A Flexible Space-Variant Anisotropic Regularization for Image Restoration with Automated Parameter Selection
- Primal-lower-nice property of value functions in optimization and control problems
- Local search proximal algorithms as decision dynamics with costs to move
- The Moreau envelope function and proximal mapping in the sense of the Bregman distance
- Nonsmooth nonconvex optimization on Riemannian manifolds via bundle trust region algorithm
- MirrorCBO: a consensus-based optimization method in the spirit of mirror descent
- A bundle trust-region algorithm for nonsmooth nonconvex constrained optimization
- A Bregman proximal point algorithm without convexity in Banach spaces
- First-order methods for nonsmooth nonconvex functional constrained optimization with or without Slater points
- On the complexity of a quadratic regularization algorithm for minimizing nonsmooth and nonconvex functions
- A descent subgradient method using Mifflin's line search for nonsmooth nonconvex optimization
- Strongly quasiconvex functions: what we know (so far)
- Proximal algorithms for a class of abstract convex functions
- Forward-backward algorithms for weakly convex problems
- Implicit score-driven filters for time-varying parameter models
- An alternating linearization bundle method for a class of nonconvex nonsmooth optimization problems
- Nonsmoothness in machine learning: specific structure, proximal identification, and applications
- On Chebyshev functions and Klee functions
- Local convergence of the proximal point method for a special class of nonconvex functions on Hadamard manifolds
This page was built for publication: Computing proximal points of nonconvex functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q959941)
