担心
发表于 2025-3-26 22:22:52
Inaccuracy in quasi-Newton methods: Local improvement theorems,re only inaccurate .-values are available. Our analysis is for the case where the relative error in . is less than one. We obtain theorems specifying local rates of improvement and limiting accuracies depending on the nearness to Newton’s method of the basic algorithm, the accuracy of its implementa
词根词缀法
发表于 2025-3-27 02:28:17
Orientation of matrices,ix. In this paper we describe a finite algorithm to make this transformation, based on the results of Camion. Our main result is that when . is a totally unimodular matrix this transformation can be made by a polynomial algorithm.
COLON
发表于 2025-3-27 07:03:12
Covering directed and odd cuts,n directed cuts and Seymour’s theorem on odd cuts. Here we strengthen these results (incidently providing a simple proof of Seymour’s theorem). For example, the minimum cardinality of a .-join in a graph .=(.) is proved to equal the maximum of Σ..(..)/2 over all partitions of . where ..(.) is the nu
epinephrine
发表于 2025-3-27 11:47:58
http://reply.papertrans.cn/63/6266/626554/626554_34.png
肮脏
发表于 2025-3-27 17:02:43
Inner estimates for the generalized gradient of the optimal value function in nonlinear programmingertain assumptions there exists an optimal solution of the reference problem whose Lagrange multiplier set intersects the generalized gradient of . at .. We investigate such relationships in more detail and prove that this generalized gradient must meet any compact multiplier set (which is relevant
冒烟
发表于 2025-3-27 18:02:54
http://reply.papertrans.cn/63/6266/626554/626554_36.png
培养
发表于 2025-3-28 01:37:11
Modelling with integer variables,xtend earlier ones due to R.R. Meyer. We provide representations whose linear relaxations have an efficient formulation, while retaining maximum accuracy to the problem modelled. Under mild hypotheses, these properties are retained as integer variables are set to values in nodes of branch-and-bound
Germinate
发表于 2025-3-28 02:25:05
Multipoint methods for separable nonlinear networks, grid’ approximations of 2, 4, and 6 segments per variable and ‘implicit grid’ strategies that generate segments as needed, but store at most a 2-segment approximation at any time. It is shown that the implicit grid methods are linearly convergent, and this predicted behavior is confirmed by highly
Misgiving
发表于 2025-3-28 09:57:28
Normal solutions of linear programs, positive multiples of the gradient of the objective function. This projection turns out to be the normal solution obtained by projecting the origin on the optimal solution set. By seeking the solution with least 2-norm which minimizes the l-norm infeasibility measure of a system of linear inequalit
体贴
发表于 2025-3-28 10:44:16
http://reply.papertrans.cn/63/6266/626554/626554_40.png