Computing proximal points of nonconvex functions
From MaRDI portal
Publication:959941
DOI10.1007/s10107-007-0124-6zbMath1168.90010OpenAlexW2007277085MaRDI QIDQ959941
Publication date: 16 December 2008
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-007-0124-6
Nonconvex programming, global optimization (90C26) Numerical optimization and variational techniques (65K10) Numerical methods based on necessary conditions (49M05) Nonsmooth analysis (49J52) Set-valued and variational analysis (49J53)
Related Items (58)
A Unified Analysis of Descent Sequences in Weakly Convex Optimization, Including Convergence Rates for Bundle Methods ⋮ An alternating linearization bundle method for a class of nonconvex nonsmooth optimization problems ⋮ Nonsmoothness in machine learning: specific structure, proximal identification, and applications ⋮ Combination of steepest descent and BFGS methods for nonconvex nonsmooth optimization ⋮ Joint estimation and variable selection for mean and dispersion in proper dispersion models ⋮ Optimization conditions and decomposable algorithms for convertible nonconvex optimization ⋮ Nonconvex bundle method with application to a delamination problem ⋮ Global Convergence of Splitting Methods for Nonconvex Composite Optimization ⋮ Global convergence of a proximal linearized algorithm for difference of convex functions ⋮ Partial Smoothness and Constant Rank ⋮ Piecewise linear approximations in nonconvex nonsmooth optimization ⋮ A generalized proximal linearized algorithm for DC functions with application to the optimal size of the firm problem ⋮ A proximal alternating linearization method for nonconvex optimization problems ⋮ A Proximal Quasi-Newton Trust-Region Method for Nonsmooth Regularized Optimization ⋮ An approximate redistributed proximal bundle method with inexact data for minimizing nonsmooth nonconvex functions ⋮ Computing proximal points of convex functions with inexact subgradients ⋮ Newton acceleration on manifolds identified by proximal gradient methods ⋮ Harnessing Structure in Composite Nonsmooth Minimization ⋮ Primal-lower-nice property of value functions in optimization and control problems ⋮ A redistributed proximal bundle method for nonsmooth nonconvex functions with inexact information ⋮ An effective nonsmooth optimization algorithm for locally Lipschitz functions ⋮ 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 ⋮ Trimmed Statistical Estimation via Variance Reduction ⋮ Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods ⋮ 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 ⋮ Local search proximal algorithms as decision dynamics with costs to move ⋮ A decomposition method with redistributed subroutine for constrained nonconvex optimization ⋮ A proximal bundle method for constrained nonsmooth nonconvex optimization with inexact information ⋮ The Proximal Alternating Direction Method of Multipliers in the Nonconvex Setting: Convergence Analysis and Rates ⋮ Unnamed Item ⋮ An infeasible bundle method for nonconvex constrained optimization with application to semi-infinite programming problems ⋮ Optimality, identifiability, and sensitivity ⋮ The Moreau envelope function and proximal mapping in the sense of the Bregman distance ⋮ Constrained nonconvex nonsmooth optimization via proximal bundle method ⋮ Derivative-free optimization via proximal point methods ⋮ 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 ⋮ On Chebyshev functions and Klee functions ⋮ Local convergence of the proximal point method for a special class of nonconvex functions on Hadamard manifolds ⋮ A filter proximal bundle method for nonsmooth nonconvex constrained optimization ⋮ On convex envelopes and regularization of non-convex functionals without moving global minima ⋮ An alternating linearization bundle method for a class of nonconvex optimization problem with inexact information ⋮ Derivative-free robust optimization by outer approximations ⋮ Inexact Newton and quasi-Newton methods for the output feedback pole assignment problem ⋮ Solving mixed variational inequalities beyond convexity ⋮ Minimizing Piecewise-Concave Functions Over Polyhedra ⋮ Proximal point method for a special class of nonconvex functions on Hadamard manifolds ⋮ A Proximal Minimization Algorithm for Structured Nonconvex and Nonsmooth Problems ⋮ Proximally Guided Stochastic Subgradient Method for Nonsmooth, Nonconvex Problems ⋮ Nonsmooth and nonconvex optimization via approximate difference-of-convex decompositions ⋮ Active‐Set Newton Methods and Partial Smoothness ⋮ A splitting bundle approach for non-smooth non-convex minimization ⋮ Minimization of non-smooth, non-convex functionals by iterative thresholding ⋮ One-Step Estimation with Scaled Proximal Methods ⋮ An extension of the proximal point algorithm beyond convexity ⋮ On strongly quasiconvex functions: existence results and proximal point algorithms
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Penalty-proximal methods in convex programming
- Exact penalty functions in proximal bundle methods for constrained convex nondifferentiable minimization
- Maximum principle in the problem of time optimal response with nonsmooth constraints
- A bundle-Newton method for nonsmooth unconstrained minimization
- Convergence of some algorithms for convex minimization
- Variable metric bundle methods: From conceptual to implementable forms
- Prox-regular functions in Hilbert spaces
- A family of variable metric proximal methods
- Prox-regularity of functions and sets in Banach spaces
- An interior-proximal method for convex linearly constrained problems and its extension to variational inequalities
- Solving semidefinite quadratic problems within nonsmooth optimization algorithms
- A Method for Solving Certain Quadratic Programming Problems Arising in Nonsmooth Optimization
- A modification and an extension of Lemarechal’s algorithm for nonsmooth minimization
- New Proximal Point Algorithms for Convex Minimization
- Monotone Operators and the Proximal Point Algorithm
- Semismooth and Semiconvex Functions in Constrained Optimization
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- Primal-Dual Gradient Structured Functions: Second-Order Results; Links to Epi-Derivatives and Partly Smooth Functions
- Minimizing Nonconvex Nonsmooth Functions via Cutting Planes and Proximity Control
- 𝒱𝒰-smoothness and proximal point results for some nonconvex functions
- Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming
- Generalized Hessian Properties of Regularized Nonsmooth Functions
- Numerical methods for nondifferentiable convex optimization
- Coupling General Penalty Schemes for Convex Programming with the Steepest Descent and the Proximal Point Algorithm
- Prox-regular functions in variational analysis
- Proximité et dualité dans un espace hilbertien
- Gobally convergent variable metric method for nonconvex nondifferentiable unconstrained minimization
- Benchmarking optimization software with performance profiles.
This page was built for publication: Computing proximal points of nonconvex functions
