In this paper we investigate how to efficiently apply ApproximateKarush-Kuhn-Tucker (AKKT) proximity measures as stopping criteria for optimization algorithms that do not generate approximations to Lagrange multipliers, in particular, Genetic Algorithms. We prove that for a wide range of constrained optimization problems the KKT error measurement tends to zero. We also develop a simple model to...

The diffusion tensor is typically assumed to be positive definite. However, noise in the measurements may cause the eigenvalues of the tensor estimate to be negative, thereby violating this assumption. Negative eigenvalues in diffusion tensor imaging (DTI) data occur predominately in regions of high anisotropy and may cause the fractional anisotropy (FA) to exceed unity. Two constrained least s...

An automatic and local fairing algorithm for bicubic Bspline surfaces is proposed. A local fairness criterion selects the knot, where the spline surface has to be faired. A fairing step is than applied, which locally modi es the control net by a constrained least-squares approximation. It consists of increasing locally the smoothness of the surface from C to C. Some extensions of this method ar...

Although voiced speech signals are physical which approximately harmonic and electric power true harmonic, the algorithms used for analysis in systems can be successfully processing, including enhancement, noise reduction, speaker recognition, hearing aids. The discrete Fourier transform (DFT), has been widely as a phasor estimator due to its simplicity, led development of new DFT-based because...

When solving the general smooth nonlinear optimization problem involving equality and/or inequality constraints, an approximate first-order critical point of accuracy ǫ can be obtained by a second-order method using cubic regularization in at most O(ǫ) problem-functions evaluations, the same order bound as in the unconstrained case. This result is obtained by first showing that the same result ...