检索结果-内蒙古大学图书馆

ON THE AVERAGE SPEED OF LEMKES ALGORITHM FOR quadratic-programming

MATHEMATICAL programming 1986年第2期35卷 236-246页

作者： WAN, YH 1.Department of Mathematics State University of New York at Buffalo 14214 Buffalo NY USA

In this paper, we show that the average number of steps of the Lemke algorithm for the quadratic programming problems grows at most linearly in the number of variables while fixing the number of constraints. The result and method were motivated by Smale's result on linear programming problems [cf. 4]. We also give the probability that a quadratic programming problem indeed possesses a finite optimal solution.

关键词： Positive semi-definite matrices quadratic programming problem Lemke's algorithm (Gaussian) measure

来源：评论

学校读者我要写书评

暂无评论

Maximum spatial-temporal isometric cluster for dynamic surface correspondence

引用

VISUAL COMPUTER 2020年第4期36卷 785-798页

作者： Pan, Xiang Cheng, Zhihao Liu, Fuchang Zhang, Sanyuan Zhejiang Univ Technol Dept Comp Sci Hangzhou Peoples R China Hangzhou Normal Univ Hangzhou Inst Serv Engn Hangzhou Peoples R China Zhejiang Univ Dept Comp Sci Hangzhou Peoples R China

Isometric correspondence is an important technique for surface correspondence. Recently, numerous algorithms have been proposed to build isometric mapping. However, those methods tend to be error prone due to the topological variation and noises of the dynamic surface. To address this issue, we propose a dynamic surface correspondence method by computing maximum spatial-temporal isometric cluster. Firstly, the algorithm defines a maximum isometric cluster score to measure the correspondence quality of each cluster in the product space. Then, the maximum problem is formulated into a quadratic programming problem. Furthermore, we define a similarity function which explicitly encodes the spatial-temporal consistence of the dynamic surface. It can greatly reduce the solving dimension, and improve the correspondence accuracy. Finally, the result is extended to the dense correspondence by a geodesic distance vector. Experimental results show that our algorithm can generate consistent correspondence on three databases of surface sequences, which outperforms existing state-of-the-art algorithms.

关键词： Dynamic surface correspondence Maximum spatial-temporal isometric cluster quadratic programming problem

来源：评论

学校读者我要写书评

暂无评论

A branch-and-bound approach for solving a class of generalized semi-infinite programming problems

引用

JOURNAL OF GLOBAL OPTIMIZATION 1998年第3期13卷 299-315页

作者： Levitin, E Tichatschke, R Russian Acad Sci Inst Syst Anal Moscow 117312 Russia Univ Trier Dept Math D-54286 Trier Germany

A nonconvex generalized semi-infinite programming problem is considered, involving parametric max-functions in both the objective and the constraints. For a fixed vector of parameters, the values of these parametric max-functions are given as optimal values of convex quadratic programming problems. Assuming that for each parameter the parametric quadratic problems satisfy the strong duality relation, conditions are described ensuring the uniform boundedness of the optimal sets of the dual problems w.r.t. the parameter. Finally a branch-and-bound approach is suggested transforming the problem of finding an approximate global minimum of the original nonconvex optimization problem into the solution of a finite number of convex problems.

关键词： branch-and-bound algorithm nonconvex optimization nondifferentiable optimization quadratic programming problem semi-infinite optimization

来源：评论

学校读者我要写书评

暂无评论

A dynamical model for solving degenerate quadratic minimax problems with constraints

引用

JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS 2011年第6期236卷 1282-1295页

作者： Nazemi, A. R. Shahrood Univ Technol Dept Math Sch Math Sci Shahrood Iran

This paper presents a new neural network model for solving degenerate quadratic minimax (DQM) problems. On the basis of the saddle point theorem, optimization theory, convex analysis theory, Lyapunov stability theory and LaSalle invariance principle, the equilibrium point of the proposed network is proved to be equivalent to the optimal solution of the DQM problems. It is also shown that the proposed network model is stable in the sense of Lyapunov and it is globally convergent to an exact optimal solution of the original problem. Several illustrative examples are provided to show the feasibility and the efficiency of the proposed method in this paper. (C) 2011 Elsevier B.V. All rights reserved.

关键词： Neural network Dynamic system Minimax problem quadratic programming problem Convergent Stability

来源：评论

学校读者我要写书评

暂无评论

New approach to training support vector machine

引用

Journal of Systems Engineering and Electronics 2006年第1期17卷 200-205,219页

作者： Tang Faming Chen Mianyun Wang Zhongdong Dept. of Control Science & Engineering Huazhong Univ. of Science and Technology Wuhan 430074 P. R. China

Support vector machine has become an increasingly popular tool for machine learning tasks involving classification, regression or novelty detection. Training a support vector machine requires the solution of a very large quadratic programming problem. Traditional optimization methods cannot be directly applied due to memory restrictions. Up to now, several approaches exist for circumventing the above shortcomings and work well. Another learning algorithm, particle swarm optimization, for training SVM is introduted. The method is tested on UCI datasets.

关键词： support vector machine quadratic programming problem particle swarm optimization.

来源：评论

学校读者我要写书评

暂无评论

Extremal behavior of hitting a cone by correlated Brownian motion with drift

引用

STOCHASTIC PROCESSES AND THEIR APPLICATIONS 2018年第12期128卷 4171-4206页

作者： Debicki, Krzysztof Hashorva, Enkelejd Ji, Lanpeng Rolski, Tomasz Univ Wroclaw Math Inst Pl Grunwaldzki 2-4 PL-50384 Wroclaw Poland Univ Lausanne Dept Actuarial Sci UNIL Dorigny CH-1015 Lausanne Switzerland Univ Leeds Sch Math Woodhouse Lane Leeds LS2 9JT W Yorkshire England

This paper derives an exact asymptotic expression for P-xu {there exists X-t(>= 0)(t) - mu t is an element of u}, as u -> infinity, where X(t) = (X-1(t),..., X-d(t))(T), t >= 0 is a correlated d-dimensional Brownian motion starting at the point x(u) = -alpha u with alpha is an element of R-d, mu is an element of R-d and U = Pi(d)(i)(=1) [0, infinity). The derived asymptotics depends on the solution of an underlying multidimensional quadratic optimization problem with constraints, which leads in some cases to dimension-reduction of the considered problem. Complementary, we study asymptotic distribution of the conditional first passage time to U, which depends on the dimension-reduction phenomena. (C) 2018 Elsevier B.V. All rights reserved.

关键词： Multidimensional Brownian motion Extremes Exact asymptotics First passage time Large deviations quadratic programming problem Multidimensional Pickands constants

来源：评论

学校读者我要写书评

暂无评论

Priority-based resource allocation in wireless powered UAV-assisted networks

引用

IET NETWORKS 2022年第5期11卷 156-168页

作者： Basharat, Mehak Naeem, Muhammad Anpalagan, Alagan Ryerson Univ Dept Elect & Comp Engn 350 Victoria St Toronto ON M5B 2K3 Canada COMSATS Univ Dept Elect & Comp Engn Wah Cantt Pakistan

Unmanned aerial vehicles (UAVs) can be deployed to combine terrestrial and aerial networks to provide flexible connectivity to a large number of devices in three-dimensional (3D) space. Powering wireless devices through energy harvesting and wireless power transfer have been investigated to provide uninterrupted operations. Resource allocation is critical to improving the overall performance of the network. This paper focusses on a downlink network in which UAVs serve as base stations to provide connectivity to ground users. A priority-based charging of UAVs from the ground charging stations needs to be efficiently designed for the sustainable operation of the overall network. A binary linear integer programming (BLIP) problem is formulated to minimise the charging cost and maximise the number of UAVs that can be charged by charging stations. First, the BLIP is transformed into a quadratic programming problem to solve it in polynomial time. A sequential quadratic programming algorithm is developed to solve the optimisation problem. Simulation results demonstrate the effectiveness of the proposed work compared to existing solutions.

关键词： charging cost terrestrial networks UAVs priority-based resource allocation binary linear integer programming problem aerial networks electric vehicle charging base stations three-dimensional space energy harvesting powering wireless devices integer programming optimisation ground charging stations autonomous aerial vehicles quadratic programming quadratic programming problem wireless power transfer ground users sustainable operation downlink network resource allocation unmanned aerial vehicles sequential quadratic programming algorithm flexible connectivity wireless powered UAV-assisted networks uninterrupted operations

来源：评论

学校读者我要写书评

暂无评论

Tail asymptotics for Shepp-statistics of Brownian motion in Double-struck capital R^d

引用

EXTREMES 2020年第1期23卷 35-54页

作者： Korshunov, Dmitry Wang, Longmin Univ Lancaster Dept Math & Stat Lancaster England Nankai Univ Sch Math Sci 94 Weijin Rd Tianjin 300071 Peoples R China

Let X(t), t. R, be a d-dimensional vector-valued Brownian motion, d = 1. For all b. Rd \ (-8, 0] d we derive exact asymptotics of P{X(t + s) - X(t) > ub for some t. [0, T], s. [0, 1]} as u -> infinity, that is the asymptotical behavior of tail distribution of vector-valued analog of Sheppstatistics for X;we cover not only the case of a fixed time-horizonT > 0 but also cases where T. 0 or T. 8. Results for high level excursion probabilities of vector-valued processes are rare in the literature, with currently no available approach suitable for our problem. Our proof exploits some distributional properties of vectorvalued Brownian motion, and results from quadratic programming problems. As a by-product we derive a new inequality for the `supremum' of vector-valued Brownian motions.

关键词： Shepp-statistics Vector-valued Brownian motion High level excursion probability Uniform double-sum method Markov property quadratic programming problem

来源：评论

学校读者我要写书评

暂无评论

Global optimality conditions for nonconvex minimization problems with quadratic constraints

引用

JOURNAL OF INEQUALITIES AND APPLICATIONS 2015年第1期2015卷 1页

作者： Li, Guoquan Wu, Zhiyou Quan, Jing Chongqing Normal Univ Dept Math Chongqing 401331 Peoples R China Yibin Univ Dept Math Yibin 644000 Sichuan Peoples R China

In this paper, some global optimality conditions for nonconvex minimization problems subject to quadratic inequality constraints are presented. Then some sufficient and necessary global optimality conditions for nonlinear programming problems with box constraints are derived. We also establish a sufficient global optimality condition for a nonconvex quadratic minimization problem with box constraints, which is expressed in a simple way in terms of the problem's data. In addition, a sufficient and necessary global optimality condition for a class of nonconvex quadratic programming problems with box constraints is discussed. We also present some numerical examples to illustrate the significance of our optimality conditions.

关键词： quadratic programming problem global optimality conditions nonconvex minimization problem box constraint

来源：评论

学校读者我要写书评

暂无评论

Continuity of the optimal value function in indefinite quadratic programming

引用

JOURNAL OF GLOBAL OPTIMIZATION 2002年第1期23卷 43-61页

作者： Tam, NN Hanoi Pedag Inst 2 Dept Math Melinh Vinhphuc Vietnam

This paper characterizes the continuity property of the optimal value function in a general parametric quadratic programming problem with linear constraints. The lower semicontinuity and upper semicontinuity propertie... 详细信息

关键词： quadratic programming problem optimal value function lower semicontinuity upper semicontinuity continuity

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：