ó
    Bpˆj/
  ã                   ó,   • S SK rSSKJr  S/rSS.S jrg)é    Né   )Únnlsr   )Úmaxiterc                óF  • [         R                  " U [         R                  SS9n [         R                  " U[         R                  S9n[        U R                  5      S:w  a  [        SU R                   35      eUR                  S:”  d#  UR                  S:X  a+  UR                  S   S:w  a  [        SUR                   35      eUR                  S:X  a#  UR                  S   S:X  a  UR                  5       nU R                  u  p4X1R                  S   :w  a"  [        S	S
U SUR                  S   4 3-   5      eUS:X  a5  [         R                  " S5      [         R                  R                  U5      4$ U(       d  SU-  n[        XU5      u  pVnUS:X  a  [        S5      eXV4$ )aJ  
Solve ``argmin_x || Ax - b ||_2^2`` for ``x>=0``.

This problem, often called as NonNegative Least Squares, is a convex
optimization problem with convex constraints. It typically arises when
the ``x`` models quantities for which only nonnegative values are
attainable; weight of ingredients, component costs and so on.

Parameters
----------
A : (m, n) ndarray
    Coefficient array
b : (m,) ndarray, float
    Right-hand side vector.
maxiter : int, optional
    Maximum number of iterations, optional. Default value is ``3 * n``.

Returns
-------
x : ndarray
    Solution vector.
rnorm : float
    The 2-norm of the residual, ``|| Ax-b ||_2``.

See Also
--------
lsq_linear : Linear least squares with bounds on the variables

Notes
-----
The code is based on the classical algorithm of [1]_. It utilizes an active
set method and solves the KKT (Karush-Kuhn-Tucker) conditions for the
non-negative least squares problem.

References
----------
.. [1] : Lawson C., Hanson R.J., "Solving Least Squares Problems", SIAM,
   1995, :doi:`10.1137/1.9781611971217`

 Examples
--------
>>> import numpy as np
>>> from scipy.optimize import nnls
...
>>> A = np.array([[1, 0], [1, 0], [0, 1]])
>>> b = np.array([2, 1, 1])
>>> nnls(A, b)
(array([1.5, 1. ]), 0.7071067811865475)

>>> b = np.array([-1, -1, -1])
>>> nnls(A, b)
(array([0., 0.]), 1.7320508075688772)

ÚC)ÚdtypeÚorder)r   é   z+Expected a 2D array, but the shape of A is r   zDExpected a 1D array,(or 2D with one column), but the, shape of b is r   z0Incompatible dimensions. The first dimension of zA is z, while the shape of b is é   z%Maximum number of iterations reached.)ÚnpÚasarray_chkfiniteÚfloat64ÚlenÚshapeÚ
ValueErrorÚndimÚravelÚemptyÚlinalgÚnormÚ_nnlsÚRuntimeError)ÚAÚbr   ÚmÚnÚxÚrnormÚinfos           ÚP/var/www/html/pdf-tiff/venv/lib/python3.13/site-packages/scipy/optimize/_nnls.pyr   r      sl  € ôp 	×Ò˜Q¤b§j¡j¸Ñ<€AÜ
×Ò˜Q¤b§j¡jÑ1€Aä
ˆ17‰7ƒ|qÓÜÐFÀqÇwÁwÀiÐPÓQÐQà	‰‹
˜Ÿ™ 1›¨1¯7©7°1©:¸«?Üð +Ø+,¯7©7¨)ð5ó 6ð 	6à
&‰&A‹+˜AŸG™G A™J¨!›OØG‰G‹Iˆà7‰7D€AàG‰GA‰JƒÜØBØ˜sÐ4°a·g±g¸a±j°^Ð4DÐEñFóGð 	Gð 	ˆAƒvÜ—’˜“œRŸY™YŸ^™^¨AÓ.Ð/Ð/æØA‘#ˆÜ˜1 Ó)N€AˆdØˆqƒyÜÐBÓCÐCàˆ8€Oó    )Únumpyr   Ú	_slsqplibr   r   Ú__all__© r!   r    Ú<module>r&      s   ðÛ Ý $ð ˆ(€ð ö Tr!   