標(biāo)題: Titlebook: Algorithms for Constrained Minimization of Smooth Nonlinear Functions; A. G. Buckley,J.- L. Goffin Book 1982Latest edition Springer-Verlag [打印本頁] 作者: Pessimistic 時間: 2025-3-21 19:50
書目名稱Algorithms for Constrained Minimization of Smooth Nonlinear Functions影響因子(影響力)
書目名稱Algorithms for Constrained Minimization of Smooth Nonlinear Functions影響因子(影響力)學(xué)科排名
書目名稱Algorithms for Constrained Minimization of Smooth Nonlinear Functions網(wǎng)絡(luò)公開度
書目名稱Algorithms for Constrained Minimization of Smooth Nonlinear Functions網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Algorithms for Constrained Minimization of Smooth Nonlinear Functions被引頻次
書目名稱Algorithms for Constrained Minimization of Smooth Nonlinear Functions被引頻次學(xué)科排名
書目名稱Algorithms for Constrained Minimization of Smooth Nonlinear Functions年度引用
書目名稱Algorithms for Constrained Minimization of Smooth Nonlinear Functions年度引用學(xué)科排名
書目名稱Algorithms for Constrained Minimization of Smooth Nonlinear Functions讀者反饋
書目名稱Algorithms for Constrained Minimization of Smooth Nonlinear Functions讀者反饋學(xué)科排名
作者: 不真 時間: 2025-3-21 22:44
Reduced quasi-Newton methods with feasibility improvement for nonlinearly constrained optimization,imating a restriction of the Hessian of the Lagrangian. Each iterate is obtained by a search along a simple curve defined by a quasi-Newton direction and a feasibility improving direction; an exact penalty function is used to determine the stepsize. The method can be viewed as an efficient approxima作者: Inclement 時間: 2025-3-22 01:07 作者: 無法解釋 時間: 2025-3-22 05:01
Computation of the search direction in constrained optimization algorithms,wever, there is considerable variation in the precise nature of the quadratic program to be solved. Furthermore, significant differences exist in the procedures advocated to ensure that the search direction is well defined, and some algorithms abandom the quadratic programming approach for particula作者: Cryptic 時間: 2025-3-22 10:22
A projected Lagrangian algorithm and its implementation for sparse nonlinear constraints,le. The algorithm is of the projected Lagrangian type, involving a sequence of sparse, linearly constrained subproblems whose objective functions include a modified Lagrangian term and a modified quadratic penalty function..The algorithm has been implemented in a general purpose FORTRAN program call作者: 積習(xí)難改 時間: 2025-3-22 14:27 作者: entice 時間: 2025-3-22 19:47 作者: 有雜色 時間: 2025-3-23 00:47 作者: Pastry 時間: 2025-3-23 04:06 作者: 地牢 時間: 2025-3-23 06:04 作者: Nomadic 時間: 2025-3-23 11:59 作者: 膽汁 時間: 2025-3-23 14:53 作者: Ingenuity 時間: 2025-3-23 18:45 作者: 難管 時間: 2025-3-24 00:05 作者: bibliophile 時間: 2025-3-24 05:45
https://doi.org/10.1007/978-3-658-24698-3erior penalty function methods and exterior penalty function methods were tested on a set of thirty problems and were rated on their ability to solve problems within a reasonable amount of computational time. The effect of the problem parameters on the solution time for the various classifications o作者: 鍍金 時間: 2025-3-24 08:14 作者: 文藝 時間: 2025-3-24 10:48 作者: 手工藝品 時間: 2025-3-24 14:53 作者: Liberate 時間: 2025-3-24 19:09 作者: Accessible 時間: 2025-3-24 23:40 作者: Ganglion 時間: 2025-3-25 07:12 作者: Alveoli 時間: 2025-3-25 08:21 作者: intercede 時間: 2025-3-25 12:28 作者: BRACE 時間: 2025-3-25 17:07
Determining feasibility of a set of nonlinear inequality constraints,imates are used. We also demonstrate that with certain choices of the penalty function, our algorithm will produce points which are as feasible as possible, on feasible problems. Some computational results are also presented.作者: ACTIN 時間: 2025-3-25 22:49
https://doi.org/10.1007/978-3-662-45207-3 that it can give large gains in efficiency when a sequence of steps has to follow a curved constraint boundary, and it provides some highly useful algorithms with a Q-superlinear rate of convergence. The watchdog technique is described and discussed, and some global and Q-superlinear convergence properties are proved.作者: INERT 時間: 2025-3-26 01:45
https://doi.org/10.1007/978-3-322-84998-4and a feasibility improving direction; an exact penalty function is used to determine the stepsize. The method can be viewed as an efficient approximation to the quasi-Newton along geodesics of [1] where feasibility was enforced at each step. Its relation with multiplier methods and recursive quadratic programming methods is also investigated.作者: tendinitis 時間: 2025-3-26 06:45
https://doi.org/10.1007/978-3-322-84998-4 incorporates a rule for choosing the penalty parameter and, near a solution, employs a search are rather than a search direction to avoid truncation of the step length, and thereby loss of superlinear convergence.作者: anticipate 時間: 2025-3-26 09:28 作者: 裝入膠囊 時間: 2025-3-26 15:33
The watchdog technique for forcing convergence in algorithms for constrained optimization, that it can give large gains in efficiency when a sequence of steps has to follow a curved constraint boundary, and it provides some highly useful algorithms with a Q-superlinear rate of convergence. The watchdog technique is described and discussed, and some global and Q-superlinear convergence properties are proved.作者: Annotate 時間: 2025-3-26 18:13 作者: Paradox 時間: 2025-3-26 22:49
A surperlinearly convergent algorithm for constrained optimization problems, incorporates a rule for choosing the penalty parameter and, near a solution, employs a search are rather than a search direction to avoid truncation of the step length, and thereby loss of superlinear convergence.作者: 使熄滅 時間: 2025-3-27 03:13 作者: 小教堂 時間: 2025-3-27 08:17
On some experiments which delimit the utility of nonlinear programming methods for engineering desif algorithms was studied. The variable parameters included the number of design variables, the number of inequality constraints, the number of equality constraints and the degree of nonlinearity of the objective function and constraints. Also a combined penalty function and linear approximation algorithm was investigated.作者: notice 時間: 2025-3-27 13:14 作者: growth-factor 時間: 2025-3-27 13:39
https://doi.org/10.1007/978-3-658-24698-3f algorithms was studied. The variable parameters included the number of design variables, the number of inequality constraints, the number of equality constraints and the degree of nonlinearity of the objective function and constraints. Also a combined penalty function and linear approximation algorithm was investigated.作者: 面包屑 時間: 2025-3-27 18:02
https://doi.org/10.1007/978-3-7091-4013-0onstraints are investigated. A preceding phase I (to obtain a good starting point) is discussed in conjunction with strategies to recognise the final active set as soon as possible. Finally, the convergence of the resulting 2-phase algorithm is proved.作者: nauseate 時間: 2025-3-28 00:01 作者: glomeruli 時間: 2025-3-28 03:43 作者: Fester 時間: 2025-3-28 07:34 作者: ASSAY 時間: 2025-3-28 10:53
https://doi.org/10.1007/978-3-642-47738-6r constraints, the issues to be discussed include incompatibility or ill-conditioning of the constraints, determination of the active set, Lagrange multiplier estimates, and approximation of the Lagrangian function.作者: 脖子 時間: 2025-3-28 16:05 作者: Blood-Vessels 時間: 2025-3-28 20:35
