Mathematical ProgrammingPang J-S (1997) Error bounds in mathematical programming. Math Program, Ser A 79(1-3):299-332Pang J-S (1997) Error bounds in mathematical programming. Math Program, Ser A 79(1–3):299–33
Error Bounds in Mathematical Programming.Error Bounds in Mathematical Programming.Discusses the implementation and numerical considerations of iterative methods for solving mathematical programs. Importance of residual functions to iterative algorithms; Applications of error bounds; Information on several studies ...
This paper shows that error bounds can be used as effective tools for deriving complexity results for first-order descent methods in convex minimization. In a first stage, this objective led us to revisit the interplay between error bounds and the Kurdyka-Łojasiewicz (KL) inequality. One can ...
The error bound (2.3) in [9] for the linear complementarity problem is the special case of (10) with the choice ∆ = In. Remark 3.17. In general, the error bounds (10) are not easy to compute. However, as we will see in the next section, the difficulty of the computation is ...
Errors can arise in many forms: from a null user input, to attempting a division by zero; although, what most users don't realise is that thumping theEsckey during program execution is also considered an error and will hence abort the program instantaneously. This usually induces the situation...
Errorboundshaveimportantapplicationsinsensitivityanalysisofmathematical programmingandinconvergenceanalysisofsomenumericalalgorithms.Inhis celebratedresult[10]datingbackto1952,A.J.Hoffmanshowedthatiffis amaximumofafinitenumberofaffinefunctionsinR n ,thentheinequality ...
Decoding error-correctiong codes by methods of mathematical optimization, most importantly linear programming, has become an important alternative approach to both algebraic and iterative decoding methods since its introduction by Feldman et al. At first celebrated mainly for its analytical powers, real-...
Our contribution is the derivation of sup-norm approximation error bounds that are pointwise functions of the sampling process, using techniques from functional analysis, probability theory and a relaxed Lipschitz condition. The performance of the method is evaluated using a single-stage reservoir ...
T. Li, New error bounds for linear complementarity problems of Nekrasov matrices and B-Nekrasov matrices, Numer. Algor., 74 (2017), 997–1009. https://doi.org/10.1007/s11075-016-0181-0 doi: 10.1007/s11075-016-0181-0 [13] M. García-Esnaola, J. M. Pen~a, B-Nekrasov matrices ...
This paper is concerned with iterative methods for the linear complementarity problem (LCP) of finding x and y in R n such that c+Dx+y≥0, b-x≥0 , and x... A Byong-Hun - 《Mathematical Programming》 被引量: 157发表: 1983年 Error bounds for linear complementarity problems for B-ma...