Interior proximal methods for quasiconvex optimization

DOI10.1007/s10898-011-9752-8zbMath1279.90135OpenAlexW1978407108MaRDI QIDQ427358

Nils Langenberg, Rainer Tichatschke

Publication date: 13 June 2012

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-011-9752-8

zbMATH Keywords

nonconvex optimizationquasi-convexitygeneralized proximal point algorithm

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Interior-point methods (90C51)

Related Items (17)

Convergence of inexact quasisubgradient methods with extrapolation ⋮ An inexact proximal method for quasiconvex minimization ⋮ An inexact algorithm with proximal distances for variational inequalities ⋮ An inexact scalarization proximal point method for multiobjective quasiconvex minimization ⋮ An interior proximal method for a class of quasimonotone variational inequalities ⋮ An inexact proximal method with proximal distances for quasimonotone equilibrium problems ⋮ Two-step inertial forward-reflected-backward splitting based algorithm for nonconvex mixed variational inequalities ⋮ Extension of forward-reflected-backward method to non-convex mixed variational inequalities ⋮ Bregman proximal point type algorithms for quasiconvex minimization ⋮ A scalarization proximal point method for quasiconvex multiobjective minimization ⋮ Strongly convex set-valued maps ⋮ Logarithmic quasi-distance proximal point scalarization method for multi-objective programming ⋮ Buffered Probability of Exceedance: Mathematical Properties and Optimization ⋮ Unnamed Item ⋮ 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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Proximal point method and elliptic regularization
• Proximal point methods and nonconvex optimization
• An interior point method with Bregman functions for the variational inequality problem with paramonotone operators
• Proximal minimization algorithm with \(D\)-functions
• An interior-proximal method for convex linearly constrained problems and its extension to variational inequalities
• Pseudomonotone operators and the Bregman proximal point algorithm
• Forcing strong convergence of proximal point iterations in a Hilbert space
• Self-adaptive inexact proximal point methods
• Convergence analysis of an extended auxiliary problem principle with various stopping criteria
• Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions
• Optimization and nonsmooth analysis
• A generalized proximal point algorithm for certain non-convex minimization problems
• On the Convergence of the Proximal Point Algorithm for Convex Minimization
• Monotone Operators and the Proximal Point Algorithm
• A Generalized Proximal Point Algorithm for the Variational Inequality Problem in a Hilbert Space
• Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming
• Note on the paper: Interior proximal method for variational inequalities on non-polyhedral sets

This page was built for publication: Interior proximal methods for quasiconvex optimization