Results 31 to 40 of about 3,215,324 (277)
Novel Global Harmony Search Algorithm for General Linear Complementarity Problem
Axioms, 2022 Linear complementarity problem (LCP) is studied. After reforming general LCP as the system of nonlinear equations by NCP-function, LCP is equivalent to solving an unconstrained optimization model, which can be solved by a recently proposed algorithm ...
Longquan Yong
doaj +1 more source
Journal of Mathematics, 2014 We consider a class of absolute-value linear complementarity problems. We propose a new approximation reformulation of absolute value linear complementarity problems by using a nonlinear penalized equation.
Yuan Li, Hai-Shan Han, Dan-Dan Yang
doaj +1 more source
A Full-Newton step infeasible-interior-point algorithm for P*(k)-horizontal linear complementarity problems [PDF]
Yugoslav Journal of Operations Research, 2015 In this paper we generalize an infeasible interior-point method for linear optimization to horizontal linear complementarity problem (HLCP). This algorithm starts from strictly feasible iterates on the central path of a perturbed problem that is
Asadi S., Mansouri H.
doaj +1 more source
The Block Principal Pivoting Algorithm for the Linear Complementarity Problem with an M-Matrix
Advances in Mathematical Physics, 2019 The principal pivoting algorithm is a popular direct algorithm in solving the linear complementarity problem, and its block forms had also been studied by many authors.
Xi-Ming Fang +2 more
doaj +1 more source
Frictional contact problem in building constructions analysis
Magazine of Civil Engineering, 2020 The article discusses the contact interaction of deformable building constructions or their parts. Such interaction is realized for example at: hydraulic structures; suspension pile foundations, girder, raft, sheet piling; friction bearings and kinematic
Aleksandr Popov, Alexander Lovtsov
doaj +1 more source
Oriented Matroids and the Linear Complementarity Problem [PDF]
, 1986 Oriented Matroids and the Linear Complementarity ...
Morris, W.
core +5 more sources
Communications in Combinatorics and Optimization, 2018 An infeasible interior-point algorithm for solving the $P_*$-matrix linear complementarity problem based on a kernel function with trigonometric barrier term is analyzed.
B. Kheirfam, M. Haghighi
doaj +1 more source
OPTIMIZATION WITH LINEAR COMPLEMENTARITY CONSTRAINTS [PDF]
Pesquisa Operacional, 2014 A Mathematical Program with Linear Complementarity Constraints (MPLCC) is an optimization problem where a continuously differentiable function is minimized on a set defined by linear constraints and complementarity conditions on pairs of complementary variables. This problem finds many applications in several areas of science, engineering and economics
openaire +4 more sources
The Distributionally Robust Optimization Reformulation for Stochastic Complementarity Problems
Abstract and Applied Analysis, 2014 We investigate the stochastic linear complementarity problem affinely affected by the uncertain parameters. Assuming that we have only limited information about the uncertain parameters, such as the first two moments or the first two moments as well as ...
Liyan Xu, Bo Yu, Wei Liu
doaj +1 more source
An MPCC Formulation and Its Smooth Solution Algorithm for Continuous Network Design Problem
Promet (Zagreb), 2017 Continuous network design problem (CNDP) is searching for a transportation network configuration to minimize the sum of the total system travel time and the investment cost of link capacity expansions by considering that the travellers follow a ...
Guangmin Wang, Junwei Yu, Shubin Li
doaj +1 more source