Interior proximal algorithm for quasiconvex programming problems and variational inequalities with linear constraints
From MaRDI portal
Publication:1762409
DOI10.1007/s10957-012-0002-0zbMath1273.90238OpenAlexW2102819983MaRDI QIDQ1762409
A. S. Brito, Jurandir O. Lopes, João Xavier da Cruz Neto, Paulo Roberto Oliveira
Publication date: 26 November 2012
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-012-0002-0
variational inequalitiesquasiconvex functionproximal algorithmquasimonotone operatorquasiconvex linearly constrained problems
Convex programming (90C25) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Interior-point methods (90C51)
Related Items
A double projection algorithm for quasimonotone variational inequalities in Banach spaces, Interior quasi-subgradient method with non-Euclidean distances for constrained quasi-convex optimization problems in Hilbert spaces, An inexact proximal method for quasiconvex minimization, A projection algorithm for non-monotone variational inequalities, An inexact algorithm with proximal distances for variational inequalities, An inexact scalarization proximal point method for multiobjective quasiconvex minimization, Relaxed-inertial proximal point type algorithms for quasiconvex minimization, Bregman proximal point type algorithms for quasiconvex minimization, A scalarization proximal point method for quasiconvex multiobjective minimization, A proximal interior point algorithm with applications to image processing, Unnamed Item, Weak convergence of iterative methods for solving quasimonotone variational inequalities, A double projection method for solving variational inequalities without monotonicity, An interior proximal linearized method for DC programming based on Bregman distance or second-order homogeneous kernels, A projection-like method for quasimonotone variational inequalities without Lipschitz continuity, On strongly quasiconvex functions: existence results and proximal point algorithms, An infeasible projection type algorithm for nonmonotone variational inequalities
Cites Work
- Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications
- A proximal method with separable Bregman distances for quasiconvex minimization over the nonnegative orthant
- Complementarity problems over cones with monotone and pseudomonotone maps
- Subdifferential properties of quasiconvex and pseudoconvex functions: Unified approach
- A logarithmic-quadratic proximal method for variational inequalities
- Proximal minimization algorithm with \(D\)-functions
- Quasiconvex optimization and location theory
- Characterization of solution sets of quasiconvex programs
- Characterization of nonsmooth semistrictly quasiconvex and strictly quasiconvex functions
- An LQP method for pseudomonotone variational inequalities
- Équations et inéquations non linéaires dans les espaces vectoriels en dualité
- A proximal point algorithm with a ϕ-divergence for quasiconvex programming
- Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions
- Optimization and nonsmooth analysis
- Entropic Proximal Mappings with Applications to Nonlinear Programming
- Monotone Operators and the Proximal Point Algorithm
- Lower subdifferentiability in minimax fractional programming*
- Variational Analysis
- Convergence of Proximal-Like Algorithms
- Entropy-Like Proximal Methods in Convex Programming
- Interior Proximal and Multiplier Methods Based on Second Order Homogeneous Kernels
- Interior Gradient and Epsilon-Subgradient Descent Methods for Constrained Convex Minimization
- Pseudomonotone variational inequalities: Convergence of proximal methods
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
