Solving Optimal Approximation Problems with Generalized Symmetry Constrains

Meihong Zhao
{"title":"Solving Optimal Approximation Problems with Generalized Symmetry Constrains","authors":"Meihong Zhao","doi":"10.1109/ICIC.2011.108","DOIUrl":null,"url":null,"abstract":"This paper provides a direct method to solve the optimal approximation problem with generalized symmetric constrains, and the general expression of the solution is also given.","PeriodicalId":6397,"journal":{"name":"2011 Fourth International Conference on Information and Computing","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2011-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 Fourth International Conference on Information and Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICIC.2011.108","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

This paper provides a direct method to solve the optimal approximation problem with generalized symmetric constrains, and the general expression of the solution is also given.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
用广义对称约束求解最优逼近问题
本文给出了一种直接求解具有广义对称约束的最优逼近问题的方法,并给出了该问题解的一般表达式。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Research on the Method of Eliminating Gross Error of GPS Output Information Efficiency of Regional Agricultural Production Based on Data Envelopment Analysis Nonlinear Analysis of a Cantilever Elastic Beam under Non-conservative Distributed Load The Confidence-degree of Mechanical Parameters of Rock Mass and Its Reliability Test Persistence and Periodicity of Nonautonomos n-Species Cooperative System with Feedback Controls and Smith Growth for Prey
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1