Feature 发表于 2025-4-1 05:53:36

P. M. Gauthierhe constraints could be non-convex, and could even be several nonconnected feasible regions..An algorithm is developed which consists of two phases, a “minimization phase” which finds a local constrained minimum and a “tunnelling phase” whose starting point is the local minimum just found, and where

Root494 发表于 2025-4-1 07:42:58

Joseph W. Jeromehe constraints could be non-convex, and could even be several nonconnected feasible regions..An algorithm is developed which consists of two phases, a “minimization phase” which finds a local constrained minimum and a “tunnelling phase” whose starting point is the local minimum just found, and where
页: 1 2 3 4 5 6 [7]
查看完整版本: Titlebook: Spline Functions and Approximation Theory; Proceedings of the S A. Meir,A. Sharma Conference proceedings 1973 Springer Basel AG 1973 Approx