找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Convexity and Optimization in Finite Dimensions I; Josef Stoer,Christoph Witzgall Book 1970 Springer-Verlag Berlin · Heidelberg 1970 Arith

[复制链接]
查看: 42159|回复: 40
发表于 2025-3-21 19:18:44 | 显示全部楼层 |阅读模式
书目名称Convexity and Optimization in Finite Dimensions I
编辑Josef Stoer,Christoph Witzgall
视频video
丛书名称Grundlehren der mathematischen Wissenschaften
图书封面Titlebook: Convexity and Optimization in Finite Dimensions I;  Josef Stoer,Christoph Witzgall Book 1970 Springer-Verlag Berlin · Heidelberg 1970 Arith
描述Dantzig‘s development of linear programming into one of the most applicable optimization techniques has spread interest in the algebra of linear inequalities, the geometry of polyhedra, the topology of convex sets, and the analysis of convex functions. It is the goal of this volume to provide a synopsis of these topics, and thereby the theoretical back­ ground for the arithmetic of convex optimization to be treated in a sub­ sequent volume. The exposition of each chapter is essentially independent, and attempts to reflect a specific style of mathematical reasoning. The emphasis lies on linear and convex duality theory, as initiated by Gale, Kuhn and Tucker, Fenchel, and v. Neumann, because it represents the theoretical development whose impact on modern optimi­ zation techniques has been the most pronounced. Chapters 5 and 6 are devoted to two characteristic aspects of duality theory: conjugate functions or polarity on the one hand, and saddle points on the other. The Farkas lemma on linear inequalities and its generalizations, Motzkin‘s description of polyhedra, Minkowski‘s supporting plane theorem are indispensable elementary tools which are contained in chapters 1, 2 and 3, resp
出版日期Book 1970
关键词Arithmetic; Convexity; Dimensions; Finite; Konvexe Planungsrechnung; Topology; algebra; function; geometry; t
版次1
doihttps://doi.org/10.1007/978-3-642-46216-0
isbn_softcover978-3-642-46218-4
isbn_ebook978-3-642-46216-0Series ISSN 0072-7830 Series E-ISSN 2196-9701
issn_series 0072-7830
copyrightSpringer-Verlag Berlin · Heidelberg 1970
The information of publication is updating

书目名称Convexity and Optimization in Finite Dimensions I影响因子(影响力)




书目名称Convexity and Optimization in Finite Dimensions I影响因子(影响力)学科排名




书目名称Convexity and Optimization in Finite Dimensions I网络公开度




书目名称Convexity and Optimization in Finite Dimensions I网络公开度学科排名




书目名称Convexity and Optimization in Finite Dimensions I被引频次




书目名称Convexity and Optimization in Finite Dimensions I被引频次学科排名




书目名称Convexity and Optimization in Finite Dimensions I年度引用




书目名称Convexity and Optimization in Finite Dimensions I年度引用学科排名




书目名称Convexity and Optimization in Finite Dimensions I读者反馈




书目名称Convexity and Optimization in Finite Dimensions I读者反馈学科排名




单选投票, 共有 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 21:20:20 | 显示全部楼层
发表于 2025-3-22 00:29:53 | 显示全部楼层
Convex Sets,le point theorems. The material presented is mostly classical: The important separation theorems for convex sets, the existence of supports, Helly’s theorem, and Brouwer’s fixed point theorem (see Bonnesen and Fenchel [.], Eggleston [.], and Fan [.]). In addition, extreme sets are discussed in detai
发表于 2025-3-22 06:33:09 | 显示全部楼层
Saddle Point Theorems,ept has been found to apply in a much larger context. It is also a natural and rich source for duality theorems. In fact, every theorem stating the existence of a “saddle point” can be interpreted as duality theorem for a pair of dual programs.
发表于 2025-3-22 11:12:22 | 显示全部楼层
发表于 2025-3-22 13:03:33 | 显示全部楼层
Managing Composite Web ServicesIt uses the oldest and most straightforward approach. There is no concern for geometrical interpretations or arithmetical efficiency as in other chapters. The systems are viewed as sets of relations, either true or false, and their logical structure and interdependence is investigated.
发表于 2025-3-22 17:39:54 | 显示全部楼层
Application Management and Web Servicesle point theorems. The material presented is mostly classical: The important separation theorems for convex sets, the existence of supports, Helly’s theorem, and Brouwer’s fixed point theorem (see Bonnesen and Fenchel [.], Eggleston [.], and Fan [.]). In addition, extreme sets are discussed in detail.
发表于 2025-3-22 21:39:57 | 显示全部楼层
Managing Composite Web Servicesept has been found to apply in a much larger context. It is also a natural and rich source for duality theorems. In fact, every theorem stating the existence of a “saddle point” can be interpreted as duality theorem for a pair of dual programs.
发表于 2025-3-23 04:52:54 | 显示全部楼层
https://doi.org/10.1007/978-3-642-46216-0Arithmetic; Convexity; Dimensions; Finite; Konvexe Planungsrechnung; Topology; algebra; function; geometry; t
发表于 2025-3-23 07:24:35 | 显示全部楼层
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-6-29 16:19
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表