全文获取类型
收费全文 | 67篇 |
免费 | 5篇 |
国内免费 | 3篇 |
专业分类
化学 | 1篇 |
综合类 | 1篇 |
数学 | 72篇 |
物理学 | 1篇 |
出版年
2023年 | 1篇 |
2022年 | 2篇 |
2021年 | 1篇 |
2017年 | 1篇 |
2016年 | 2篇 |
2014年 | 4篇 |
2013年 | 4篇 |
2012年 | 7篇 |
2011年 | 5篇 |
2010年 | 5篇 |
2009年 | 5篇 |
2008年 | 8篇 |
2007年 | 6篇 |
2006年 | 2篇 |
2005年 | 1篇 |
2004年 | 1篇 |
2001年 | 2篇 |
2000年 | 2篇 |
1999年 | 3篇 |
1998年 | 3篇 |
1997年 | 1篇 |
1996年 | 1篇 |
1995年 | 4篇 |
1994年 | 1篇 |
1993年 | 1篇 |
1980年 | 1篇 |
1979年 | 1篇 |
排序方式: 共有75条查询结果,搜索用时 15 毫秒
1.
P. Q. Khanh 《Journal of Optimization Theory and Applications》1995,87(2):359-378
We prove the Kuhn-Tucker sufficient optimality condition, the Wolfe duality, and a modified Mond-Weir duality for vector optimization problems involving various types of invex-convexlike functions. The class of such functins contains many known generalized convex functions. As applications, we demonstrate that, under invex-convexlikeness assumptions, the Pontryagin maximum principle is a sufficient optimality condition for cooperative differential games. The Wolfe duality is established for these games.The author is indebted to the referees and Professor W. Stadler for valuable remarks and comments, which have been used to revise considerably the paper. 相似文献
2.
Invex-convexlike functions and duality 总被引:4,自引:0,他引:4
P. Q. Khanh 《Journal of Optimization Theory and Applications》1995,87(1):141-165
We define a class of invex-convexlike functions, which contains all convex, pseudoconvex, invex, and convexlike functions, and prove that the Kuhn-Tucker sufficient optimality condition and the Wolfe duality hold for problems involving such functions. Applications in control theory are given.The author is grateful to Professor W. Stadler and the referees for many valuable remarks and suggestions, which have enabled him to improve considerably the paper. 相似文献
3.
The line search method incorporating the Wolfe conditions is modified to ensure that a descent algorithm terminates in a finite number of steps at an approximate stationary point where the second-order conditions of optimality are satisfied. A simple procedure based on conjugate directions is proposed to determine directions of negative curvature. 相似文献
4.
5.
共轭梯度法是求解无约束最优化问题的有效方法.本文在βkDY的基础上对βk引入参数,提出了一类新共轭梯度法,并证明其在强Wolfe线性搜索条件下具有充分下降性和全局收敛性. 相似文献
6.
O. Briant C. Lemaréchal Ph. Meurdesoif S. Michel N. Perrot F. Vanderbeck 《Mathematical Programming》2008,113(2):299-344
When a column generation approach is applied to decomposable mixed integer programming problems, it is standard to formulate
and solve the master problem as a linear program. Seen in the dual space, this results in the algorithm known in the nonlinear
programming community as the cutting-plane algorithm of Kelley and Cheney-Goldstein. However, more stable methods with better
theoretical convergence rates are known and have been used as alternatives to this standard. One of them is the bundle method;
our aim is to illustrate its differences with Kelley’s method. In the process we review alternative stabilization techniques
used in column generation, comparing them from both primal and dual points of view. Numerical comparisons are presented for
five applications: cutting stock (which includes bin packing), vertex coloring, capacitated vehicle routing, multi-item lot
sizing, and traveling salesman. We also give a sketchy comparison with the volume algorithm.
This research has been supported by Inria New Investigation Grant “Convex Optimization and Dantzig-Wolfe Decomposition”. 相似文献
7.
Wolfe Duality for Interval-Valued Optimization 总被引:1,自引:0,他引:1
H. C. Wu 《Journal of Optimization Theory and Applications》2008,138(3):497-509
Weak and strong duality theorems in interval-valued optimization problem based on the formulation of the Wolfe primal and
dual problems are derived. The solution concepts of the primal and dual problems are based on the concept of nondominated
solution employed in vector optimization problems. The concepts of no duality gap in the weak and strong sense are also introduced,
and strong duality theorems in the weak and strong sense are then derived. 相似文献
8.
共轭梯度法是最优化中最常用的方法之一,广泛地应用于求解大规模优化问题,其中参数β_k的不同选取可以构成不同的共轭梯度法.给出了一类含有三个参数的共轭梯度算法,这种算法能够在给定的条件下证明选定的β_k在每一步都能产生一个下降方向,同时在强Wolfe线搜索下,这种算法具有全局收敛性. 相似文献
9.
In this paper, we make a modification to the Liu-Storey (LS) conjugate gradient method and propose a descent LS method. The method can generate sufficient descent directions for the objective function. This property is independent of the line search used. We prove that the modified LS method is globally convergent with the strong Wolfe line search. The numerical results show that the proposed descent LS method is efficient for the unconstrained problems in the CUTEr library. 相似文献
10.
在修正PRP共轭梯度法的基础上,提出了求解无约束优化问题的一个充分下降共轭梯度算法,证明了算法在Wolfe线搜索下全局收敛,并用数值实验表明该算法具有较好的数值结果. 相似文献