维普期刊资源整合服务平台（V6.5）

83篇 您的检索式：作者名="TERLAKY T"

选中清除导出查看参考文献查看引证文献引用追踪共5页首页上一页第1页下一页末页 /5 跳转

	题名	作者	年代	出处	被引量
1	New and efficient large-update interior-point method for linear optimization 显示文摘	PENG J M ROOS C TERLAKY T	2001	J Comput Technol2001，4，：	2
2	Self-regular Functions and New Search Directions for Linear and Semidefinite Optimizations 显示文摘	Peng J M Roos C Terlaky T	2002	Mathematical Programming2002，93，：	1
3	A new class of polynomial primal-dual methods for linear and semidefinite optimization显示文摘	Peng J Roos C Terlaky T	2002	Eur J Oper Res2002，143，2：	1
4	Postponing the choice of the barrier parameter in Mehrotra-type predictor-corrector Algo-rithms显示文摘	SALAHI M TERLAKY T		0，，02：	1
5	New complexity analysis of the primal-dual method for semidefinite optimization based on the nesterov-todd direction显示文摘	Peng J Roos C Terlaky T		0，，2：	1
6	Polynomiality of Primal-dual Affine Scaling Algorithm for Nonlinear Complementarity Problems显示文摘	Jansen B Roos C Terlaky T	1997	Mathematical Program ming1997，78，：	1
7	Self-Regular Proximities and New Search Directions for Linear and Semidefinite Optimization显示文摘	Peng J M Roos C Terlaky T	2002	Mathematical Programming2002，93，：	1
8	Improved Complexity Using Higher-Order Correetors for Primal-Dual Dikin Affine Scaling 显示文摘	Jansen B Roos C Terlaky T	1996	Math Program1996，76，1：	1
9	On implementing a primal-dual interior-point method for conic quadratic optimization显示文摘	Andersen E D Roos C Terlaky T	2003	Mathematical Programming2003，95，：	1
10	Self-regular functions and new search directions for linear and semidefinite optimization 显示文摘	PENG J ROOS C TERLAKY T	2002	Mathematical Programming2002，，93：	1
11	criss-cross method显示文摘	Terlaky T covergent A	1985	Math 0per Und Sta Ser Optimization1985，16，5：	1
12	Polynomiality of primal-dual affine scaling algorithm for nonlinear complementarity problems显示文摘	Jansen B Roos C Terlaky T	1997	Mathematical Programming1997，78，：	1
13	A new and efficient large-up-date interior-point method for linear optimization显示文摘	Peng J Roos C Terlaky T	2001	Jour- nal of computational Technologies2001，6，4：	1
14	New complexity analysis of the primaldual Newton method for linear optimization显示文摘	Peng J Roos C Terlaky T	2000	Annals of Operations Research2000，99，1：	1
15	A new class of polynomial primal-dual methods for linear and semi-definite opti- mization显示文摘	Peng J Roos C Terlaky T	2002	European Journal of Operations Re- search2002，143，2：	1
16	A monotonic build-up sim-plex algorithm for linear programming显示文摘	Anstreicher K M Terlaky T		0，，03：	1
17	A new and efficient large-update interior-point method for linear optimization 显示文摘	Peng J Roos C Terlaky T	2001	Journal of Computational Technologies2001，6，4：	1
18	New complexity analysis of the primal-dual Newton method for linear optimiza- tion显示文摘	Peng J Roos C Terlaky T	2000	Operations Research2000，99，：	1
19	On implementing a pri- mal-dual interior-point method for conic quadratic optimi- zation显示文摘	Andersen E D Roos C Terlaky T	2003	Mathematical Programming2003，95，2：	1
20	A new class of polynomial primal-dual methods for linear and semidefinite optimization显示文摘	Peng J Roos C Terlaky T	2002	European Journal of Operational Research2002，143，2：	1

返回顶部每页显示：

共5页首页上一页第1页下一页末页 /5 跳转

互联网出版许可证新出网证(渝)字10号全国400电话 - 免长途话费

用户提示