推荐同事 机构合作 中文 繁體中文 English 한국어 日本語 Português Español

美国ACCDON公司旗下品牌

021-54106218，021-33363733

chinasupport@letpub.com

登录 注册 新注册优惠

[CITATION] An Alternative Approach to Solve Quadratic Programming Problem with Homogeneous Constraints

A Khurana, S Singh… - Global Journal of Pure and Applied Mathematics, 2011
Related articles - All 2 versions

A sequential quadratic programming method without a penalty function or a filter for nonlinear equality constrained optimization

[PDF] from cc.ac.cnX Liu… - SIAM Journal on Optimization, 2011 - link.aip.org
We present a sequential quadratic programming method without using a penalty function or a
filter for solving nonlinear equality constrained optimization. In each iteration, the linearized constraints
of the quadratic programming are relaxed to satisfy two mild conditions; the step-size is ...
Related articles - All 9 versions

Global exponential stability of discrete-time recurrent neural network for solving quadratic programming problems subject to linear constraints

Q Liu… - Neurocomputing, 2011 - Elsevier
Constrained quadratic programming has many applications in scientific and engineering
areas, such as signal and image processing, manufacturing, optimal control, and pattern
recognition. Over the past years, a variety of numerical algorithms have been developed ...
Related articles

[PDF] Globally Solving Nonconvex Quadratic Programming Problems via Completely Positive Programming

[PDF] from optimization-online.orgJ Chen… - 2011 - optimization-online.org
Abstract Nonconvex quadratic programming (QP) is an NP-hard problem that optimizes a general
quadratic function over linear constraints. This paper introduces a new global optimization algorithm
for this problem, which combines two ideas from the literature—finite branching based on ...
Related articles - View as HTML

Block-structured quadratic programming for the direct multiple shooting method for optimal control

[PDF] from optimization-online.orgC Kirches, HG Bock, JP Schlöder… - Optimization Methods & …, 2011 - Taylor & Francis
In this contribution, we address the efficient solution of optimal control problems of dynamic processes
with many controls. Such problems arise, for example, from the outer convexification of integer
control decisions. We treat this optimal control problem class using the direct multiple ...
Cited by 6 - Related articles - All 5 versions

联系我们 | 站点地图 | 友情链接 | 授权代理商 | 加入我们

© 2010-2024 中国: LetPub上海分公司    网站备案号：沪ICP备10217908号-1    沪公网安备号：31010402006960

增值电信业务经营许可证：沪B2-20211595

礼翰商务信息咨询（上海）有限公司      办公地址：上海市徐汇区漕溪北路88号圣爱大厦1803室

United States: Tel: 1-781-202-9968 Address: 400 5th Ave, Suite 530, Waltham, Massachusetts 02451