Results 311 to 320 of about 1,487,617 (328)
Some of the next articles are maybe not open access.
A Large-Step Infeasible-Interior-Point Method for the P*-Matrix LCP
SIAM Journal on Optimization, 1997A large-step infeasible-interior-point method is proposed for solving $P_*(\k)$-matrix linear complementarity problems. It is new even for monotone LCP. The algorithm generates points in a large neighborhood of an infeasible central path. Each iteration requires only one matrix factorization.
Rongqin Sheng, Florian A. Potra
openaire +2 more sources
A nonlinear P matrix model to simulate intermodulation products in SAW devices
2012 IEEE International Ultrasonics Symposium, 2012Nonlinear intermodulation distortion inside duplexers is a limitation for the sensitivity of mobile devices receivers. A perturbation approach for non linear harmonic acoustic generation along the propagation of surface acoustic wave is derived. It is used to extend the P matrix model to non linear generation of harmonics and mixing products. Interface
Li Chen+3 more
openaire +2 more sources
A Simple P-Matrix Linear Complementarity Problem for Discounted Games
2008The values of a two-player zero-sum binary discounted game are characterized by a P-matrix linear complementarity problem (LCP). Simple formulas are given to describe the data of the LCP in terms of the game graph, discount factor, and rewards. Hence it is shown that the unique sink orientation (USO) associated with this LCP coincides with the strategy
Rahul Savani, Marcin Jurdziński
openaire +2 more sources
A linear complementarity problem with an n by 2n “P”-matrix
1978The problem considered in this paper is given by the conditions: w=q+Mv+Nx, w≧0, v≧0, x≧0, v≦r, w T v=0 and (r−v) T x=0. Here q, r are n-vectors with r>0 and M, N are n by n matrices. We say that an n by 2n matrix (M, N) has the P-property if all of its “principal” minors are positive.
openaire +2 more sources
Fast calculation of the gradient and the difference vector of IDT's p matrix [PDF]
The transduction. and reflection coefficients of SPUDTs are usually determined by optimization methods. Some methods need gradients or the difference vectors of IDT's P matrix in order to calculate the corresponding quantities of the error function.
openaire +1 more source
P-Matrix Reasoning and Information Intelligent Mining
Applied Mathematics and Nonlinear Sciences, 2023exaly
Plasticity leaves a phenotypic signature during local adaptation
Evolution Letters, 2020Daniel W A Noble+2 more
exaly
Computation of Error Bounds for P-matrix Linear Complementarity Problems
Mathematical Programming, 2006Shuhuang Xiang, Xiaojun Chen
exaly
EvolQG - An R package for evolutionary quantitative genetics
F1000Research, 2015Diogo Melo+2 more
exaly +2 more sources