Proximal Point Methods and Nonconvex Optimization

Authors:
A. Kaplan;R. Tichatschke
Affiliations:
Department of Mathematics, University of Trier, Trier, Germany;Department of Mathematics, University of Trier, Trier, Germany
Venue:
Journal of Global Optimization
Year:
1998

Citing 9
Cited 6

Penalty—proximal methods in convex programming

Journal of Optimization Theory and Applications
An ellipsoid trust region bundle method for nonsmooth convex minimization

SIAM Journal on Control and Optimization
A view of unconstrained optimization

Optimization
Penalization in non-classical convex programming via variational convergence

Mathematical Programming: Series A and B
Proximal minimization algorithm with D-functions

Journal of Optimization Theory and Applications
On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators

Mathematical Programming: Series A and B
A proximal-based decomposition method for convex minimization problems

Mathematical Programming: Series A and B
Entropy-like proximal methods in convex programming

Mathematics of Operations Research
Convex analysis and variational problems

Convex analysis and variational problems

Auxiliary Problem Principle and Proximal Point Methods

Journal of Global Optimization
Self-adaptive inexact proximal point methods

Computational Optimization and Applications
An inexact proximal point method for solving generalized fractional programs

Journal of Global Optimization
Asymptotic convergence of an inertial proximal method for unconstrained quasiconvex minimization

Journal of Global Optimization
Relatively relaxed proximal point algorithms for generalized maximal monotone mappings and Douglas-Rachford splitting methods

WSEAS Transactions on Mathematics
Interior proximal methods for quasiconvex optimization

Journal of Global Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

The goal of this paper is to discover some possibilities forapplying the proximal point method to nonconvex problems. It can be provedthat – for a wide class of problems – proximal regularizationperformed with appropriate regularization parameters ensures convexity ofthe auxiliary problems and each accumulation point of the method satisfiesthe necessary optimality conditions.