咨询与建议

限定检索结果

文献类型

  • 58 篇 期刊文献
  • 4 篇 会议

馆藏范围

  • 62 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 54 篇 理学
    • 54 篇 数学
    • 1 篇 统计学(可授理学、...
  • 39 篇 管理学
    • 38 篇 管理科学与工程(可...
    • 1 篇 图书情报与档案管...
  • 26 篇 工学
    • 18 篇 软件工程
    • 10 篇 计算机科学与技术...
    • 4 篇 电气工程
    • 2 篇 信息与通信工程
    • 2 篇 控制科学与工程
    • 1 篇 石油与天然气工程
  • 1 篇 医学
    • 1 篇 临床医学

主题

  • 62 篇 nonconvex quadra...
  • 19 篇 global optimizat...
  • 15 篇 semidefinite pro...
  • 6 篇 branch-and-bound
  • 4 篇 trust-region sub...
  • 3 篇 second-order con...
  • 2 篇 semidefinite opt...
  • 2 篇 branch and bound
  • 2 篇 trust region sub...
  • 2 篇 semidefinite pro...
  • 2 篇 exact penalty
  • 2 篇 extremal convex ...
  • 2 篇 second-order-con...
  • 2 篇 local minimum
  • 2 篇 copositive progr...
  • 2 篇 nonconcave quadr...
  • 2 篇 convex hull
  • 2 篇 necessary and su...
  • 2 篇 lift-and-project...
  • 2 篇 convex envelope

机构

  • 9 篇 univ iowa dept m...
  • 2 篇 univ iowa dept b...
  • 2 篇 cnrs laas f-3107...
  • 2 篇 humboldt univ d-...
  • 2 篇 univ toulouse en...
  • 2 篇 xidian univ sch ...
  • 2 篇 univ iowa dept m...
  • 2 篇 axioma inc marie...
  • 2 篇 univ toulouse up...
  • 2 篇 czech tech univ ...
  • 1 篇 cornell univ ctr...
  • 1 篇 chuo univ jst cr...
  • 1 篇 sw jiaotong univ...
  • 1 篇 clemson univ dep...
  • 1 篇 univ naples part...
  • 1 篇 univ wisconsin m...
  • 1 篇 univ concepcion ...
  • 1 篇 department of ma...
  • 1 篇 keio univ dept a...
  • 1 篇 elect reliabil c...

作者

  • 10 篇 burer samuel
  • 4 篇 anstreicher kurt...
  • 3 篇 yang boshi
  • 2 篇 fan lei
  • 2 篇 vandenbussche di...
  • 2 篇 liu sanyang
  • 2 篇 messine frederic
  • 2 篇 nowak i
  • 2 篇 li ang
  • 2 篇 peng jiming
  • 2 篇 henrion didier
  • 1 篇 valiaho h
  • 1 篇 gao yuelin
  • 1 篇 de angelis pl
  • 1 篇 piccialli veroni...
  • 1 篇 du tingsong
  • 1 篇 bentobache mohan...
  • 1 篇 du pengwei
  • 1 篇 kojima masakazu
  • 1 篇 boggs pt

语言

  • 58 篇 英文
  • 3 篇 其他
  • 1 篇 德文
  • 1 篇 中文
检索条件"主题词=Nonconvex quadratic programming"
62 条 记 录,以下是1-10 订阅
排序:
A new bound-and-reduce approach of nonconvex quadratic programming problems
收藏 引用
APPLIED MATHEMATICS AND COMPUTATION 2015年 250卷 298-308页
作者: Gao, Yuelin Wei, Fei Natl Univ Nationalities Inst Informat & Syst Sci Beijing Peoples R China Xidian Univ Sch Comp Sci & Technol Xian 710071 Peoples R China
For the nonconvex quadratic programming problem, a new linear programming relaxation bound-and-reduce algorithm is proposed and its convergence is proved. In this algorithm, a new hyper-rectangle partition technique a... 详细信息
来源: 评论
Tight compact extended relaxations for nonconvex quadratic programming problems with box constraints
收藏 引用
JOURNAL OF GLOBAL OPTIMIZATION 2022年 第3期84卷 591-606页
作者: de Vries, Sven Perscheid, Bernd Trier Univ FB Math 4 Operat Res D-54286 Trier Germany
Cutting planes from the Boolean Quadric Polytope can be used to reduce the optimality gap of the NP-hard nonconvex quadratic program with box constraints (BoxQP). It is known that all cuts of the Chvatal-Gomory closur... 详细信息
来源: 评论
Conic approximation to nonconvex quadratic programming with convex quadratic constraints
收藏 引用
JOURNAL OF GLOBAL OPTIMIZATION 2015年 第3期61卷 459-478页
作者: Deng, Zhibin Fang, Shu-Cherng Jin, Qingwei Lu, Cheng Univ Chinese Acad Sci Sch Management Beijing Peoples R China N Carolina State Univ Dept Ind & Syst Engn Raleigh NC 27695 USA Zhejiang Univ Dept Management Sci & Engn Hangzhou 310003 Zhejiang Peoples R China Tsinghua Univ Dept Elect Engn Beijing 100084 Peoples R China
In this paper, a conic reformulation and approximation is proposed for solving a nonconvex quadratic programming problem subject to several convex quadratic constraints. The original problem is transformed into a line... 详细信息
来源: 评论
Solving Jigsaw Puzzles via nonconvex quadratic programming With the Projected Power Method
收藏 引用
IEEE TRANSACTIONS ON MULTIMEDIA 2021年 23卷 2310-2320页
作者: Yan, Fang Zheng, Yuanjie Cong, Jinyu Liu, Liu Tao, Dacheng Hou, Sujuan Shandong Normal Univ Sch Informat Sci & Engn Jinan 250014 Peoples R China Univ Shandong Key Lab Intelligent Comp & Informat Secur Jinan 250014 Peoples R China Shandong Prov Key Lab Novel Distributed Comp Soft Jinan 250014 Peoples R China Shandong Normal Univ Inst Biomed Sci Jinan 250014 Peoples R China Univ Sydney URTECH Sydney Artificial Intelligence Ctr Fac Engn Darlington NSW 2008 Australia Univ Sydney Sch Comp Sci Fac Engn Darlington NSW 2008 Australia
Jigsaw puzzles consist of reconstructing a picture that has been divided into many interlocking pieces. This paper describes an automatic global method for solving the square-piece jigsaw puzzle problem in which neith... 详细信息
来源: 评论
A new rectangle branch-and-reduce approach for solving nonconvex quadratic programming problems
收藏 引用
APPLIED MATHEMATICS AND COMPUTATION 2005年 第2期168卷 1409-1418页
作者: Gao, YL Xue, HG Shen, PP NW Secondly Natl Coll Dept Informat & Computat Sci Yin Chuan 750021 Peoples R China Ningxia Univ Sch Math & Comp Sci Yin Chuan 750021 Peoples R China Xian Sci & Technol Univ Dept Math Xian 710048 Peoples R China Henan Normal Univ Sch Math & Informat Sci Xinxiang 453007 Henan Peoples R China
The paper presents a new rectangle branch-and-reduce approach for solving nonconvex quadratic programming problems, in which a new lower approximate linear functions of the quadratic function over an n-rectangle is gi... 详细信息
来源: 评论
New LP-based local and global algorithms for continuous and mixed-integer nonconvex quadratic programming
收藏 引用
JOURNAL OF GLOBAL OPTIMIZATION 2022年 第4期82卷 659-689页
作者: Bentobache, Mohand Telli, Mohamed Mokhtari, Abdelkader Univ Laghouat Lab Pure & Appl Math Laghouat Algeria
In this work, we propose a new approach called "Successive Linear programming Algorithm (SLPA)" for finding an approximate global minimizer of general nonconvex quadratic programs. This algorithm can be init... 详细信息
来源: 评论
A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations
收藏 引用
MATHEMATICAL programming 2008年 第2期113卷 259-282页
作者: Burer, Samuel Vandenbussche, Dieter Univ Iowa Dept Management Sci Iowa City IA 52242 USA Axioma Inc Marietta GA 30068 USA
Existing global optimization techniques for nonconvex quadratic programming (QP) branch by recursively partitioning the convex feasible set and thus generate an infinite number of branch-and-bound nodes. An open quest... 详细信息
来源: 评论
A parametric linear relaxation algorithm for globally solving nonconvex quadratic programming
收藏 引用
APPLIED MATHEMATICS AND COMPUTATION 2015年 250卷 973-985页
作者: Jiao, Hongwei Liu, Sanyang Lu, Nan Xidian Univ Sch Math & Stat Xian 710071 Peoples R China
In this article, we present a parametric linear relaxation algorithm for globally solving the nonconvex quadratic programming (NQP). In this algorithm, a new parametric linearized technique is proposed for generating ... 详细信息
来源: 评论
A barrier function method for the nonconvex quadratic programming problem with box constraints
收藏 引用
JOURNAL OF GLOBAL OPTIMIZATION 2000年 第2期18卷 165-188页
作者: Dang, CY Xu, L City Univ Hong Kong Dept Mfg Engn & Engn Management Kowloon Hong Kong Peoples R China Chinese Univ Hong Kong Dept Comp Sci & Engn Hong Kong Hong Kong Peoples R China
In this paper a barrier function method is proposed for approximating a solution of the nonconvex quadratic programming problem with box constraints. The method attempts to produce a solution of good quality by follow... 详细信息
来源: 评论
Combining DCA (DC Algorithms) and interior point techniques for large-scale nonconvex quadratic programming
收藏 引用
OPTIMIZATION METHODS & SOFTWARE 2008年 第4期23卷 609-629页
作者: Dinh, T. Pham Le Thi, H. A. Akoa, F. Natl Inst Appl Sci Lab Modelling Optimizat & Operat Res Rouen France Univ Paul Verlaine MIM UFR Lab Theoret & Appl Comp Sci Metz France
In this paper, we provide a new regularization technique based on DC programming and DC Algorithms to handle indefinite Hessians in a primal-dual interior point context for nonconvex quadratic programming problems. Th... 详细信息
来源: 评论