Results 221 to 230 of about 5,566,782 (273)

Maximum Entropy on the Complex Probability Framework. [PDF]

Entropy (Basel)
Tapiador FJ.
europepmc   +1 more source

Mars' enigmatic interior -recent findings from InSight and open questions. [PDF]

Nat Commun
Fernando B, Charalambous C, Economon S.
europepmc   +1 more source

Enhanced electrical conductivity at Fe₃O₄ grain boundaries. [PDF]

Sci Adv
Yao T, Gao C, Sun Z, Tao A, Jiang Y, Yang Z, Ma XL, Ye H, Chen C.   +8 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Interior-Point Methods

2017
One of the most powerful methods for solving nonlinear optimization problems known as interior point methods is to be presented in this chapter. They are related to barrier functions. The terms “interior point methods” and “barrier methods” have the same significance and may be used interchangeably.
Richard W. Cottle, Mukund N. Thapa
  +4 more sources

Insights into the interior-point methods

ZOR Zeitschrift f�r Operations Research Methods and Models of Operations Research, 1992
This paper studies the search directions of three important interior- point algorithms, namely, the primal-affine scaling method, the dual- affine scaling method and the primal-dual interior point method (with logarithmic barrier function). From an algebraic point of view, the paper shows that the search directions of these three algorithms are merely ...
Ruey-Lin Sheu, Shu-Cherng Fang
openaire   +2 more sources

An interior‐point algorithm for elastoplasticity

International Journal for Numerical Methods in Engineering, 2006
AbstractThe problem of small‐deformation, rate‐independent elastoplasticity is treated using convex programming theory and algorithms. A finite‐step variational formulation is first derived after which the relevant potential is discretized in space and subsequently viewed as the Lagrangian associated with a convex mathematical program.
Krabbenhoft, K., Lyamin, A. V., Sloan, S. W., Wriggers, P.   +3 more
openaire   +2 more sources

Inequalities for a Simplex and an Interior Point

Geometriae Dedicata, 2001
Let \(S\) be an \(n\)-dimensional simplex in Euclidean \(n\)-space whose circum- and inradius are given by \(R\) and \(r\), respectively. Further, \(d_i\) be the distance from an interior point \(P\) of \(S\) to its \(i\)th facet, \(i=0,1, \dots, n\).
Leng, Gangsong, Ma, Tongyi, Qian, Xiangzheng   +2 more
openaire   +2 more sources