A proximal method with logarithmic barrier for nonlinear complementarity problems
DOI10.1007/S10898-015-0266-7zbMATH Open1346.90777OpenAlexW2036281063MaRDI QIDQ280087FDOQ280087
Authors: Rolando Gárciga Otero, Alfredo 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
Recommendations
- A generalized proximal point algorithm for the nonlinear complementarity problem
- A new logarithmic-quadratic proximal method for nonlinear complementarity problems
- Interior hybrid proximal extragradient methods for the linear monotone complementarity problem
- A hybrid inexact logarithmic-quadratic proximal method for nonlinear complementarity problems
- Existence and proximal point algorithms for nonlinear monotone complementarity problems*
interior point methodsmonotonicitypseudomonotonicitynonlinear complementarity problemsproximal methodscut propertylogarithmic barrier
Interior-point methods (90C51) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Cites Work
- Enlargement of monotone operators with applications to variational inequalities
- Monotone Operators and the Proximal Point Algorithm
- Proximal Minimization Methods with Generalized Bregman Functions
- Title not available (Why is that?)
- A logarithmic-quadratic proximal method for variational inequalities
- Conditions ensuring the applicability of cutting-plane methods for solving variational inequalities
- Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions
- \(\varepsilon\)-enlargements of maximal monotone operators in Banach spaces
- Proximal minimization algorithm with \(D\)-functions
- On the convergence rate of entropic proximal optimization methods
- Interior proximal method for variational inequalities: Case of nonparamonotone operators
- 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
- On a generalization of paramonotone maps and its application to solving the Stampacchia variational inequality
- Entropy in linear programs
- Title not available (Why is that?)
- A generalized proximal point algorithm for the nonlinear complementarity problem
- Entropy-Like Proximal Methods in Convex Programming
- Title not available (Why is that?)
- Convergence Rate Analysis of Nonquadratic Proximal Methods for Convex and Linear Programming
- On the cutting plane property and the Bregman proximal point algorithm
- Title not available (Why is that?)
- Regularized Lotka-Volterra dynamical system as continuous proximal-like method in optimization.
- Multiplicative iterative algorithms for convex programming
Cited In (2)
This page was built for publication: A proximal method with logarithmic barrier for nonlinear complementarity problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q280087)
