找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Separable Optimization; Theory and Methods Stefan M. Stefanov Book 2021Latest edition The Editor(s) (if applicable) and The Author(s), unde

[复制链接]
查看: 14948|回复: 66
发表于 2025-3-21 17:14:33 | 显示全部楼层 |阅读模式
书目名称Separable Optimization
副标题Theory and Methods
编辑Stefan M. Stefanov
视频video
概述The third part of the book includes three new chapters dedicated to applications.New chapters are devoted to an in depth analysis of the Knapsack problem.Second edition provides comprehensive coverage
丛书名称Springer Optimization and Its Applications
图书封面Titlebook: Separable Optimization; Theory and Methods Stefan M. Stefanov Book 2021Latest edition The Editor(s) (if applicable) and The Author(s), unde
描述.In this book, the theory, methods and applications of separable optimization are considered. Some general results are presented, techniques of approximating the separable problem by linear programming problem, and dynamic programming are also studied. Convex separable programs subject to inequality/ equality constraint(s) and bounds on variables are also studied and convergent iterative algorithms of polynomial complexity are proposed.  As an application, these algorithms are used in the implementation of stochastic quasigradient methods to some separable stochastic programs. The problems of numerical approximation of tabulated functions and numerical solution of overdetermined systems of linear algebraic equations and some systems of nonlinear equations are solved by separable convex unconstrained minimization problems. Some properties of the Knapsack polytope are also studied. This second edition includes a substantial amount of new and revised content. Three new chapters, 15-17, are included. Chapters 15-16 are devoted to the further analysis of the Knapsack problem. Chapter 17 is focused on the analysis of a nonlinear transportation problem. Three new Appendices (E-G) are also
出版日期Book 2021Latest edition
关键词Approximation; algorithms; linear optimization; operations research; Knapsack problem; bounded variables;
版次2
doihttps://doi.org/10.1007/978-3-030-78401-0
isbn_softcover978-3-030-78403-4
isbn_ebook978-3-030-78401-0Series ISSN 1931-6828 Series E-ISSN 1931-6836
issn_series 1931-6828
copyrightThe Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Switzerl
The information of publication is updating

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




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




书目名称Separable Optimization网络公开度




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




书目名称Separable Optimization被引频次




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




书目名称Separable Optimization年度引用




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




书目名称Separable Optimization读者反馈




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




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

0票 0%

Perfect with Aesthetics

 

0票 0%

Better Implies Difficulty

 

0票 0%

Good and Satisfactory

 

0票 0%

Adverse Performance

 

0票 0%

Disdainful Garbage

您所在的用户组没有投票权限
发表于 2025-3-21 23:02:53 | 显示全部楼层
Separable Optimization978-3-030-78401-0Series ISSN 1931-6828 Series E-ISSN 1931-6836
发表于 2025-3-22 00:56:47 | 显示全部楼层
Springer Optimization and Its Applicationshttp://image.papertrans.cn/s/image/865307.jpg
发表于 2025-3-22 06:29:36 | 显示全部楼层
https://doi.org/10.1007/978-3-030-78401-0Approximation; algorithms; linear optimization; operations research; Knapsack problem; bounded variables;
发表于 2025-3-22 10:57:11 | 显示全部楼层
发表于 2025-3-22 15:57:17 | 显示全部楼层
Introduction. Approximating the Separable ProblemIn this chapter, some basic concepts and formulations concerning separable programs are introduced. Approximation of the separable problem by a linear program is considered and a restricted basis entry rule for solving the resulting linear program by the simplex method is discussed. Some numerical examples are also presented.
发表于 2025-3-22 20:11:51 | 显示全部楼层
Convex Separable ProgrammingAs it was pointed out in Chapter Two, if . are strictly convex and . are convex for . and . in problem (.) (.)–(.), the standard simplex method, discarding the restricted basis entry rule, is applicable to the approximating linear program (.) (.)–(.).
发表于 2025-3-22 22:36:53 | 显示全部楼层
Separable Programming: A Dynamic Programming ApproachThis chapter is devoted to the dynamic programming approach for solving (separable) programs for both discrete and continuous cases. The Lagrange multiplier method for reducing the dimensionality of the problem is discussed, and some separable and other models are reviewed at the end of the chapter.
发表于 2025-3-23 02:11:39 | 显示全部楼层
Statement of the Main Problem. Basic ResultConsider the following convex separable programming problem (.): .subject to .where . and . are twice differentiable convex functions, defined on the open convex sets . in ., ., respectively; . for every ., and ..
发表于 2025-3-23 05:33:51 | 显示全部楼层
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-13 11:43
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表