找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Optimization Techniques; Proceedings of the 9 K. Iracki,K. Malanowski,S. Walukiewicz Conference proceedings 1980 Springer-Verlag Berlin Hei

[复制链接]
查看: 34698|回复: 67
发表于 2025-3-21 16:39:06 | 显示全部楼层 |阅读模式
书目名称Optimization Techniques
副标题Proceedings of the 9
编辑K. Iracki,K. Malanowski,S. Walukiewicz
视频video
丛书名称Lecture Notes in Control and Information Sciences
图书封面Titlebook: Optimization Techniques; Proceedings of the 9 K. Iracki,K. Malanowski,S. Walukiewicz Conference proceedings 1980 Springer-Verlag Berlin Hei
出版日期Conference proceedings 1980
关键词Algebra; Optimization; Quasi-Newton method; STATISTICA; algorithms; linear optimization; nonlinear optimiz
版次1
doihttps://doi.org/10.1007/BFb0006580
isbn_softcover978-3-540-10081-2
isbn_ebook978-3-540-38253-9Series ISSN 0170-8643 Series E-ISSN 1610-7411
issn_series 0170-8643
copyrightSpringer-Verlag Berlin Heidelberg 1980
The information of publication is updating

书目名称Optimization Techniques影响因子(影响力)




书目名称Optimization Techniques影响因子(影响力)学科排名




书目名称Optimization Techniques网络公开度




书目名称Optimization Techniques网络公开度学科排名




书目名称Optimization Techniques被引频次




书目名称Optimization Techniques被引频次学科排名




书目名称Optimization Techniques年度引用




书目名称Optimization Techniques年度引用学科排名




书目名称Optimization Techniques读者反馈




书目名称Optimization Techniques读者反馈学科排名




单选投票, 共有 1 人参与投票
 

0票 0.00%

Perfect with Aesthetics

 

0票 0.00%

Better Implies Difficulty

 

1票 100.00%

Good and Satisfactory

 

0票 0.00%

Adverse Performance

 

0票 0.00%

Disdainful Garbage

您所在的用户组没有投票权限
发表于 2025-3-21 22:16:47 | 显示全部楼层
https://doi.org/10.1007/BFb0006580Algebra; Optimization; Quasi-Newton method; STATISTICA; algorithms; linear optimization; nonlinear optimiz
发表于 2025-3-22 03:27:20 | 显示全部楼层
发表于 2025-3-22 05:33:24 | 显示全部楼层
发表于 2025-3-22 12:03:21 | 显示全部楼层
0170-8643 Overview: 978-3-540-10081-2978-3-540-38253-9Series ISSN 0170-8643 Series E-ISSN 1610-7411
发表于 2025-3-22 13:38:20 | 显示全部楼层
A method for solving equality constrained optimization problems by unconstrained minimization,ed minimization. The main computational problems arising in the minimization of the augmented Lagrangian are discussed and a procedure for the automatic selection of the penalty coefficient is described. Numerical results obtained for a set of standard test problems are reported.
发表于 2025-3-22 19:59:04 | 显示全部楼层
Alternative group relaxation of integer programming problems,ent computational load and different relaxation..The aim of this work is to analyze some group problems, associated to the same (IP), both from the point of view of the relaxation of the (IP) and of the complexity of the group solution algorithm; evaluation criteria for these group problems are pointed out.
发表于 2025-3-22 21:45:31 | 显示全部楼层
发表于 2025-3-23 04:12:09 | 显示全部楼层
发表于 2025-3-23 05:48:05 | 显示全部楼层
Factorized variable metric algorithms for unconstrained optimization,ison has been done between the LDL. decomposition of the BFS algorithm versus its unfactorized version. The special feature of this comparison consists in the choice of test problems most of them possessing severe ill-conditioning characteristics. Numerical results show with sufficient evidence that
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-25 19:11
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表