A proximal method with logarithmic barrier for nonlinear complementarity problems

DOI10.1007/S10898-015-0266-7MaRDI QIDQ280087zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

interior point methodsmonotonicitypseudomonotonicitynonlinear complementarity problemsproximal methodscut propertylogarithmic barrier

Mathematics Subject Classification ID

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

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^*

Cites work

• scientific article; zbMATH DE number 1268621 (Why is no real title available?)
• scientific article; zbMATH DE number 776083 (Why is no real title available?)
• scientific article; zbMATH DE number 3341597 (Why is no real title available?)
• scientific article; zbMATH DE number 2228225 (Why is no real title available?)
• A generalized proximal point algorithm for the nonlinear complementarity problem
• A logarithmic-quadratic proximal method for variational inequalities
• A theorem on maximal monotonic sets in Hilbert space
• Conditions ensuring the applicability of cutting-plane methods for solving variational inequalities
• Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions
• Convergence Rate Analysis of Nonquadratic Proximal Methods for Convex and Linear Programming
• Double-regularization proximal methods, with complementarity applications
• Enlargement of monotone operators with applications to variational inequalities
• Entropy in linear programs
• Entropy-Like Proximal Methods in Convex Programming
• Inexact proximal point methods for variational inequality problems
• Interior proximal method for variational inequalities: Case of nonparamonotone operators
• Monotone Operators and the Proximal Point Algorithm
• Multiplicative iterative algorithms for convex programming
• On a generalization of paramonotone maps and its application to solving the Stampacchia variational inequality
• On the convergence rate of entropic proximal optimization methods
• On the cutting plane property and the Bregman proximal point algorithm
• Proximal Minimization Methods with Generalized Bregman Functions
• Proximal minimization algorithm with \(D\)-functions
• Regularized Lotka-Volterra dynamical system as continuous proximal-like method in optimization.
• Rescaling and stepsize selection in proximal methods using separable generalized distances
• Some properties of generalized proximal point methods for quadratic and linear programming
• \(\varepsilon\)-enlargements of maximal monotone operators in Banach spaces

Cited in

(2)

• A new filter QP-free method for the nonlinear inequality constrained optimization problem
• scientific article; zbMATH DE number 6027003 (Why is no real title available?)

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)