Computing proximal points of nonconvex functions

DOI10.1007/s10107-007-0124-6zbMath1168.90010MaRDI QIDQ959941

B. E. Eshmatov

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

zbMATH Keywords

nonsmooth optimization; nonconvex optimization; proximal point; prox-regular; lower-\({\mathcal{C}}^2\)

Mathematics Subject Classification ID

90C26: Nonconvex programming, global optimization

65K10: Numerical optimization and variational techniques

49M05: Numerical methods based on necessary conditions

49J52: Nonsmooth analysis

49J53: Set-valued and variational analysis

Related Items

On Chebyshev functions and Klee functions, Local convergence of the proximal point method for a special class of nonconvex functions on Hadamard manifolds, Piecewise linear approximations in nonconvex nonsmooth optimization

Uses Software

• PNEW

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.