Results 41 to 50 of about 650 (106)

A new smoothing method for solving nonlinear complementarity problems

open access: yesOpen Mathematics, 2019
In this paper, a new improved smoothing Newton algorithm for the nonlinear complementarity problem was proposed. This method has two-fold advantages. First, compared with the classical smoothing Newton method, our proposed method needn’t nonsingular of ...
Zhu Jianguang, Hao Binbin
doaj   +1 more source

Uniqueness of market equilibria on networks with transport costs

open access: yesOperations Research Perspectives, 2018
We study the existence and uniqueness of equilibria for perfectly competitive markets in capacitated transport networks. The model under consideration is rather general so that it captures basic aspects of related models in, e.g., gas or electricity ...
Vanessa Krebs, Martin Schmidt
doaj   +1 more source

An implicit method for finding a common fixed point of a representation of nonexpansive mappings in Banach spaces

open access: yesFixed Point Theory and Applications, 2014
We introduce an implicit method for finding an element of the set of common fixed points of a representation of nonexpansive mappings. Then we prove the strong convergence of the proposed implicit scheme to the common fixed point of a representation of ...
N. Hussain   +2 more
semanticscholar   +2 more sources

A Semismooth Newton Method for Tensor Eigenvalue Complementarity Problem

open access: yes, 2015
In this paper, we consider the tensor eigenvalue complementarity problem which is closely related to the optimality conditions for polynomial optimization, as well as a class of differential inclusions with nonconvex processes.
Chen, Zhongming, Qi, Liqun
core   +1 more source

A shrinkage-thresholding projection method for sparsest solutions of LCPs

open access: yesJournal of Inequalities and Applications, 2014
In this paper, we study the sparsest solutions of linear complementarity problems (LCPs), which study has many applications, such as bimatrix games and portfolio selections. Mathematically, the underlying model is NP-hard in general.
Meijuan Shang, C. Nie
semanticscholar   +2 more sources

Iterative algorithms for common elements in fixed point sets and zero point sets with applications

open access: yes, 2012
In this study, Mann-type iterative process is considered for finding a common element in the fixed point set of strict pseudocontractions and in the zero point set of the operator which is the sum of inverse strongly- monotone operators and maximal ...
Mingliang Zhang
semanticscholar   +1 more source

On the nonlinear implicit complementarity problem

open access: yes, 1992
International Journal of Mathematics and Mathematical Sciences, Volume 16, Issue 4, Page 783-789, 1993.
A. H. Siddiqi, Q. H. Ansari
wiley   +1 more source

A globally convergent algorithm for MPCC

open access: yesEURO Journal on Computational Optimization, 2015
We propose a penalty formulation based on the new regularization scheme for mathematical programs with complementarity constraints (MPCCs). We present an active set method which solves a sequence of penalty-regularized problems.
Abdeslam Kadrani   +2 more
doaj   +1 more source

Some algorithms for equilibrium problems on Hadamard manifolds

open access: yes, 2012
In this paper, we suggest and analyze an iterative method for solving the equilibrium problems on Hadamard manifolds using the auxiliary principle technique. We also consider the convergence analysis of the proposed method under suitable conditions. Some
M. Noor, K. Noor
semanticscholar   +1 more source

The almost semimonotone matrices

open access: yesSpecial Matrices, 2019
A (strictly) semimonotone matrix A ∈ ℝn×n is such that for every nonzero vector x ∈ ℝn with nonnegative entries, there is an index k such that xk > 0 and (Ax)k is nonnegative (positive).
Wendler Megan
doaj   +1 more source

Home - About - Disclaimer - Privacy