清洗
发表于 2025-3-25 06:35:59
http://reply.papertrans.cn/71/7022/702106/702106_21.png
GIST
发表于 2025-3-25 08:49:46
On the Degree of Decentralization in Large-Scale Linear ProgrammingLarge-scale linear programs with primal blockangular structure are considered. The numerical effort for solving primal-blockangular LPs with fixed problem size depends heavily on how scarce available common resources are. Having this fact in mind we investigate the benefits of . for the common resources and present preliminary results.
Factorable
发表于 2025-3-25 12:10:11
http://reply.papertrans.cn/71/7022/702106/702106_23.png
后退
发表于 2025-3-25 17:47:02
On Convergence of Proximal Methods to Fixed Points of Extremal MappingsThe problem of finding the equilibrium points of an extremal mapping is considered. The methods controlled by means of feedback are suggested to compute the fixed points of an extremal mapping. Their convergence to the solution of the equilibrium problem is proved.
VAN
发表于 2025-3-25 22:22:55
A Reduced Directions Method for Solving Stochastic Problems in the Dialog Optimization System ODISFor solving nonlinear stochastic programming problems a reduced generalized gradient method is suggested which is implemented as a special part in the DIALOG OPTIMIZATION SYSTEM ODIS.
榨取
发表于 2025-3-26 03:45:11
http://reply.papertrans.cn/71/7022/702106/702106_26.png
脱水
发表于 2025-3-26 05:47:56
On Finiteness of Modified Beale’s Algorithm for Solving Nonconvex Quadratic ProgramThe paper deals with Beale’s method, which is generalized for calculating a local minimum of any quadratic objective function subject to linear constraints. A theoretical background of the algorithm is given briefly and the finiteness of the procedure is proved. Solving of degenerate problems is mentioned.
星球的光亮度
发表于 2025-3-26 09:56:48
http://reply.papertrans.cn/71/7022/702106/702106_28.png
Peculate
发表于 2025-3-26 14:24:13
A Descent Level Bundle Method for Convex Nondifferentiable Optimizationst to the original level methods of Lemarechal, Nemirovskii and Nesterov, our method is globally convergent without any compactness assumptions and requires bounded storage. It does not employ potentially expensive linesearches as does the level method of Brännlund. Preliminary numerical experience is reported.
传染
发表于 2025-3-26 18:04:00
http://reply.papertrans.cn/71/7022/702106/702106_30.png