The complexity of optimizing over a simplex, hypercube or sphere: a short survey
Author:
Publisher
Springer Science and Business Media LLC
Subject
Management Science and Operations Research
Link
http://link.springer.com/content/pdf/10.1007/s10100-007-0052-9.pdf
Reference34 articles.
1. Ausiello G, D’Atri A and Protasi M (1980). Structure preserving reductions among convex optimization problems. J Comput Syst Sci 21: 136–153
2. Barvinok (2007) A integration and optimization of multivariate polynomials by restriction onto a random subspace. Found Comput Math (to appear)
3. Bellare M and Rogaway P (1995). The complexity of approximating a nonlinear program. Math Program 69: 429–441
4. Blum L, Shub M and Smale S (1989). On a theory of computation and complexity over the real numbers: NP-completeness, recursive functions and universal machines. Bull Am Math Soc (NS) 21(1): 1–46
5. Bomze IM (2002). Regularity versus degeneracy in dynamics, games and optimization: a unified approach to different aspects. SIAM Rev 44(3): 394–414
Cited by 57 articles. 订阅此论文施引文献 订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. On Dealing with Minima at the Border of a Simplicial Feasible Area in Simplicial Branch and Bound;Journal of Optimization Theory and Applications;2024-07-22
2. Distributionally Robust Optimization for Nonconvex QCQPs with Stochastic Constraints;2023 62nd IEEE Conference on Decision and Control (CDC);2023-12-13
3. On the Separation of Correlation-Assisted Sum Capacities of Multiple Access Channels;IEEE Transactions on Information Theory;2023-09
4. Finding local optima in quadratic optimization problems in RP;Soft Computing;2023-05-14
5. An inexact projected gradient method with rounding and lifting by nonlinear programming for solving rank-one semidefinite relaxation of polynomial optimization;Mathematical Programming;2022-11-29
1.学者识别学者识别
2.学术分析学术分析
3.人才评估人才评估
"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370
www.globalauthorid.com
TOP
Copyright © 2019-2024 北京同舟云网络信息技术有限公司 京公网安备11010802033243号 京ICP备18003416号-3