全文获取类型
收费全文 | 48篇 |
免费 | 0篇 |
国内免费 | 1篇 |
专业分类
数学 | 49篇 |
出版年
2021年 | 1篇 |
2018年 | 1篇 |
2017年 | 3篇 |
2016年 | 1篇 |
2015年 | 2篇 |
2014年 | 1篇 |
2013年 | 1篇 |
2012年 | 3篇 |
2011年 | 5篇 |
2010年 | 2篇 |
2009年 | 2篇 |
2006年 | 2篇 |
2005年 | 1篇 |
2004年 | 1篇 |
2002年 | 1篇 |
2000年 | 1篇 |
1997年 | 4篇 |
1996年 | 1篇 |
1994年 | 3篇 |
1992年 | 1篇 |
1991年 | 1篇 |
1990年 | 2篇 |
1986年 | 1篇 |
1984年 | 1篇 |
1983年 | 1篇 |
1982年 | 2篇 |
1981年 | 1篇 |
1978年 | 1篇 |
1977年 | 2篇 |
排序方式: 共有49条查询结果,搜索用时 15 毫秒
1.
Termination criteria for the iterative solution of bound-constrained optimization problems are examined in the light of backward
error analysis. It is shown that the problem of determining a suitable perturbation on the problem’s data corresponding to
the definition of the backward error is analytically solvable under mild assumptions. Moreover, a link between existing termination
criteria and this solution is clarified, indicating that some standard measures of criticality may be interpreted in the sense
of backward error analysis. The backward error problem is finally considered from the multicriteria optimization point of
view and some numerical illustration is provided. 相似文献
2.
Serge Gratton Selime G��rol Philippe L. Toint 《Computational Optimization and Applications》2013,54(1):1-25
When solving nonlinear least-squares problems, it is often useful to regularize the problem using a quadratic term, a practice which is especially common in applications arising in inverse calculations. A solution method derived from a trust-region Gauss-Newton algorithm is analyzed for such applications, where, contrary to the standard algorithm, the least-squares subproblem solved at each iteration of the method is rewritten as a quadratic minimization subject to linear equality constraints. This allows the exploitation of duality properties of the associated linearized problems. This paper considers a recent conjugate-gradient-like method which performs the quadratic minimization in the dual space and produces, in exact arithmetic, the same iterates as those produced by a standard conjugate-gradients method in the primal space. This dual algorithm is computationally interesting whenever the dimension of the dual space is significantly smaller than that of the primal space, yielding gains in terms of both memory usage and computational cost. The relation between this dual space solver and PSAS (Physical-space Statistical Analysis System), another well-known dual space technique used in data assimilation problems, is explained. The use of an effective preconditioning technique is proposed and refined convergence bounds derived, which results in a practical solution method. Finally, stopping rules adequate for a trust-region solver are proposed in the dual space, providing iterates that are equivalent to those obtained with a Steihaug-Toint truncated conjugate-gradient method in the primal space. 相似文献
3.
Monte Carlo methods have extensively been used and studied in the area of stochastic programming. Their convergence properties
typically consider global minimizers or first-order critical points of the sample average approximation (SAA) problems and
minimizers of the true problem, and show that the former converge to the latter for increasing sample size. However, the assumption
of global minimization essentially restricts the scope of these results to convex problems. We review and extend these results
in two directions: we allow for local SAA minimizers of possibly nonconvex problems and prove, under suitable conditions,
almost sure convergence of local second-order solutions of the SAA problem to second-order critical points of the true problem.
We also apply this new theory to the estimation of mixed logit models for discrete choice analysis. New useful convergence
properties are derived in this context, both for the constrained and unconstrained cases, and associated estimates of the
simulation bias and variance are proposed.
Research Fellow of the Belgian National Fund for Scientific Research 相似文献
4.
Nicholas I. M. Gould Dominique Orban Annick Sartenaer Phillipe L. Toint 《4OR: A Quarterly Journal of Operations Research》2005,3(3):227-241
In this paper, we examine the sensitivity of trust-region algorithms on the parameters related to the step acceptance and
update of the trust region. We show, in the context of unconstrained programming, that the numerical efficiency of these algorithms
can easily be improved by choosing appropriate parameters. Recommended ranges of values for these parameters are exhibited
on the basis of extensive numerical tests.
MSC classification:
65K05, 90C26, 90C30 相似文献
5.
Frank E. Curtis Nicholas I. M. Gould Daniel P. Robinson Philippe L. Toint 《Mathematical Programming》2017,161(1-2):73-134
We present an interior-point trust-funnel algorithm for solving large-scale nonlinear optimization problems. The method is based on an approach proposed by Gould and Toint (Math Prog 122(1):155–196, 2010) that focused on solving equality constrained problems. Our method is similar in that it achieves global convergence guarantees by combining a trust-region methodology with a funnel mechanism, but has the additional capability of being able to solve problems with both equality and inequality constraints. The prominent features of our algorithm are that (i) the subproblems that define each search direction may be solved with matrix-free methods so that derivative matrices need not be formed or factorized so long as matrix-vector products with them can be performed; (ii) the subproblems may be solved approximately in all iterations; (iii) in certain situations, the computed search directions represent inexact sequential quadratic optimization steps, which may be desirable for fast local convergence; (iv) criticality measures for feasibility and optimality aid in determining whether only a subset of computations need to be performed during a given iteration; and (v) no merit function or filter is needed to ensure global convergence. 相似文献
6.
A new method is introduced for solving equality constrained nonlinear optimization problems. This method does not use a penalty function, nor a filter, and yet can be proved to be globally convergent to first-order stationary points. It uses different trust-regions to cope with the nonlinearities of the objective function and the constraints, and allows inexact SQP steps that do not lie exactly in the nullspace of the local Jacobian. Preliminary numerical experiments on CUTEr problems indicate that the method performs well. 相似文献
7.
The complexity of finding $\epsilon $ -approximate first-order critical points for the general smooth constrained optimization problem is shown to be no worse that $O(\epsilon ^{-2})$ in terms of function and constraints evaluations. This result is obtained by analyzing the worst-case behaviour of a first-order short-step homotopy algorithm consisting of a feasibility phase followed by an optimization phase, and requires minimal assumptions on the objective function. Since a bound of the same order is known to be valid for the unconstrained case, this leads to the conclusion that the presence of possibly nonlinear/nonconvex inequality/equality constraints is irrelevant for this bound to apply. 相似文献
8.
M'Barek Fares Serge Gratton Philippe L. Toint 《Numerical Linear Algebra with Applications》2011,18(1):55-68
A new numerical procedure is proposed for the reconstruction of the shape and volume of unknown objects from measurements of their radiation in the far field. This procedure is a variant and the linear sampling method has a very acceptable computational load and is fully automated. It is based on exploiting an iteratively computed truncated singular‐value decomposition and heuristics to extract the desired signal from the background noise. Its performance on a battery of examples of different types is shown to be promising. Copyright © 2010 John Wiley & Sons, Ltd. 相似文献
9.
An Adaptive Regularisation algorithm using Cubics (ARC) is proposed for unconstrained optimization, generalizing at the same
time an unpublished method due to Griewank (Technical Report NA/12, 1981, DAMTP, University of Cambridge), an algorithm by
Nesterov and Polyak (Math Program 108(1):177–205, 2006) and a proposal by Weiser et al. (Optim Methods Softw 22(3):413–431,
2007). At each iteration of our approach, an approximate global minimizer of a local cubic regularisation of the objective
function is determined, and this ensures a significant improvement in the objective so long as the Hessian of the objective
is locally Lipschitz continuous. The new method uses an adaptive estimation of the local Lipschitz constant and approximations
to the global model-minimizer which remain computationally-viable even for large-scale problems. We show that the excellent
global and local convergence properties obtained by Nesterov and Polyak are retained, and sometimes extended to a wider class
of problems, by our ARC approach. Preliminary numerical experiments with small-scale test problems from the CUTEr set show encouraging performance of the ARC algorithm when compared to a basic trust-region implementation. 相似文献
10.
Serge Gratton Ehouarn Simon David Titley‐Peloquin Philippe L. Toint 《Numerical Linear Algebra with Applications》2021,28(1)
We investigate the method of conjugate gradients, exploiting inaccurate matrix‐vector products, for the solution of convex quadratic optimization problems. Theoretical performance bounds are derived, and the necessary quantities occurring in the theoretical bounds estimated, leading to a practical algorithm. Numerical experiments suggest that this approach has significant potential, including in the steadily more important context of multiprecision computations. 相似文献