A proximal method with logarithmic barrier for nonlinear complementarity problems

DOI10.1007/s10898-015-0266-7zbMath1346.90777OpenAlexW2036281063MaRDI QIDQ280087

Rolando Gárciga Otero, Alfredo Noel Iusem

Publication date: 29 April 2016

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

Full work available at URL: https://doi.org/10.1007/s10898-015-0266-7

zbMATH Keywords

monotonicity interior point methods logarithmic barrier nonlinear complementarity problems pseudomonotonicity proximal methods cut property

Mathematics Subject Classification ID

Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Interior-point methods (90C51)

Related Items (1)

A new filter QP-free method for the nonlinear inequality constrained optimization problem

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Regularized Lotka-Volterra dynamical system as continuous proximal-like method in optimization.
Multiplicative iterative algorithms for convex programming
A logarithmic-quadratic proximal method for variational inequalities
Proximal minimization algorithm with \(D\)-functions
On the convergence rate of entropic proximal optimization methods
Enlargement of monotone operators with applications to variational inequalities
Conditions ensuring the applicability of cutting-plane methods for solving variational inequalities
Interior proximal method for variational inequalities: Case of nonparamonotone operators
\(\varepsilon\)-enlargements of maximal monotone operators in Banach spaces
Some properties of generalized proximal point methods for quadratic and linear programming
A theorem on maximal monotonic sets in Hilbert space
Double-regularization proximal methods, with complementarity applications
Rescaling and Stepsize Selection in Proximal Methods Using Separable Generalized Distances
Inexact Proximal Point Methods for Variational Inequality Problems
Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions
On a generalization of paramonotone maps and its application to solving the Stampacchia variational inequality
Entropy in linear programs
Monotone Operators and the Proximal Point Algorithm
Proximal Minimization Methods with Generalized Bregman Functions
A generalized proximal point algorithm for the nonlinear complementarity problem
Entropy-Like Proximal Methods in Convex Programming
Convergence Rate Analysis of Nonquadratic Proximal Methods for Convex and Linear Programming

This page was built for publication: A proximal method with logarithmic barrier for nonlinear complementarity problems