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

A differentiable path-following algorithm for computing perfect stationary points

COMPUTATIONAL OPTIMIZATION AND APPLICATIONS 2020年第2期76卷 571-588页

作者： Zhan, Yang Li, Peixuan Dang, Chuangyin City Univ Hong Kong Dept Syst Engn & Engn Management Hong Kong Peoples R China

This paper is concerned with the computation of perfect stationary point, which is a strict refinement of stationary point. A differentiable homotopy method is developed for finding perfect stationary points of continuous functions on convex polytopes. We constitute an artificial problem by introducing a continuously differentiable function of an extra variable. With the optimality conditions of this problem and a fixed point argument, a differentiable homotopy mapping is constructed. As the extra variable becomes close to zero, the homotopy path naturally provides a sequence of closely approximate stationary points on perturbed polytopes, and converges to a perfect stationary point on the original polytope. Numerical experiments are implemented to further illustrate the effectiveness of our method.

关键词： Stationary point Perfectness Homotopy method path-following algorithm

来源：评论

学校读者我要写书评

暂无评论

GLOBAL LINEAR CONVERGENCE OF A path-following algorithm FOR SOME MONOTONE VARIATIONAL INEQUALITY PROBLEMS

引用

JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS 1992年第2期75卷 265-279页

作者： TSENG, P 1. Department of Mathematics University of Washington Seattle Washington

We consider a primal-scaling path-following algorithm for solving a certain class of monotone variational inequality problems. Included in this class are the convex separable programs considered by Monteiro and Adler and the monotone linear complementarity problem. This algorithm can start from any interior solution and attain a global linear rate of convergence with a convergence ratio of 1 - c/square-root m, where m denotes the dimension of the problem and c is a certain constant. One can also introduce a line search strategy to accelerate the convergence of this algorithm.

关键词： MONOTONE VARIATIONAL INEQUALITIES NEWTON ITERATIONS path-following algorithm LINEAR CONVERGENCE

来源：评论

学校读者我要写书评

暂无评论

An improved phase-coding method for absolute phase retrieval based on the path-following algorithm

引用

OPTICS AND LASERS IN ENGINEERING 2019年 122卷 65-73页

作者： Lv, Shenzhen Sun, Qiang Yang, Jianbai Jiang, Yang Qu, Feng Wang, Jian Chinese Acad Sci R&D Ctr Precis Instruments & Equipment Changchun Inst Opt Fine Mech & Phys 3888 Dongnanhu Rd Changchun Jilin Peoples R China Univ Chinese Acad Sci Beijing 100049 Peoples R China

Although the traditional phase-coding method for absolute phase retrieval possesses strong robustness, the method leads to unwrapping artifacts as a mass of codewords required. To solve this problem, a novel improved method is proposed in this paper. The incorrect points in the recovered phase via the traditional method are located using a computational framework, and the path-following algorithm is adopted as an aid to correct the unwrapping artifacts. The effectiveness of the proposed method is experimentally verified by an established measurement system. The reconstructed geometry of standard sphere has sufficient accuracy and the absolute phase retrieval of a complex star object has high quality.

关键词： Phase unwrapping 3D shape measurement Unwrapping artifact path-following algorithm

来源：评论

学校读者我要写书评

暂无评论

A New Second-Order Infeasible Primal-Dual path-following algorithm for Symmetric Optimization

引用

NUMERICAL FUNCTIONAL ANALYSIS AND OPTIMIZATION 2016年第4期37卷 499-519页

作者： Yang, Ximei Zhang, Yinkui Liu, Hongwei Shen, Peiping Henan Normal Univ Coll Math & Informat Sci Xinxiang 453007 Peoples R China Xidian Univ Sch Math & Stat Xian Peoples R China

In this article, we propose a new second-order infeasible primal-dual path-following algorithm for symmetric cone optimization. The algorithm further improves the complexity bound of a wide infeasible primal-dual path-following algorithm. The theory of Euclidean Jordan algebras is used to carry out our analysis. The convergence is shown for a commutative class of search directions. In particular, the complexity bound is ?(r(5/4)logE(-1)) for the Nesterov-Todd direction, and ?(r(7/4)logE(-1)) for the xs and sx directions, where r is the rank of the associated Euclidean Jordan algebra and E is the required precision. If the starting point is strictly feasible, then the corresponding bounds can be reduced by a factor of r(3/4). Some preliminary numerical results are provided as well.

关键词： Euclidean Jordan algebra infeasible path-following algorithm second-order corrector symmetric cone optimization 90C05 90C51

来源：评论

学校读者我要写书评

暂无评论

CONTAINING AND SHRINKING ELLIPSOIDS IN THE path-following algorithm

引用

MATHEMATICAL PROGRAMMING 1990年第1期47卷 1-9页

作者： YE, YY TODD, MJ UNIV IOWA DEPT MANAGEMENT SCIIOWA CITYIA CORNELL UNIV DEPT OPERAT RES & IND ENGNITHACANY 14853

We describe a new potential function and a sequence of ellipsoids in the path-following algorithm for convex quadratic programming. Each ellipsoid in the sequence contains all of the optimal primal and dual slack vectors. Furthermore, the volumes of the ellipsoids shrink at the ratio $2^{ - \Omega (\sqrt n )} $ , in comparison to 2?Ω(1) in Karmarkar's algorithm and 2?Ω(1/n) in the ellipsoid method. We also show how to use these ellipsoids to identify the optimal basis in the course of the algorithm for linear programming.

关键词： Linear programming convex quadratic programming path-following algorithm Karmarkar's algorithm ellipsoid method

来源：评论

学校读者我要写书评

暂无评论

Adaptive Articulation Angle Preview-Based path-following algorithm for Tractor-Semitrailer Using Optimal Control

引用

SENSORS 2022年第14期22卷 5163-5163页

作者： Tang, Xuequan Yan, Yunbing Wang, Baohua Zhang, Lin Wuhan Univ Sci & Technol Dept Automobile & Traff Engn 2 Huangjiahu West Rd Wuhan 430065 Peoples R China Hubei Univ Automot Technol Dept Automobile Engn Shiyan 442002 Peoples R China

Most existing path-following algorithms (PFAs) are developed for single-unit vehicles (SUVs) and rarely for articulated vehicles (AVs). Since these PFAs ignore the motion of the trailer, they may cause large tracking deviations and ride stability issues when cornering. To this end, an Adaptive Articulation Angle Preview-based path-following algorithm (AAAP-PFA) is proposed for AVs. Different from previous PFAs, in this model, a simple linear vehicle dynamics model is used as the prediction model, and an offset distance calculated by an articulation angle is used as part of the preview distance. An adaptive posture control strategy is designed to trade off the trajectory tracking performance and lateral stability performance during the path-following process. Considering a large prediction mismatch caused by using a linear vehicle dynamics model, a feedback correction method is proposed to improve the robustness of the steering control. In the comparison simulation experiment with SUV-PFA, it is confirmed that the novel PFA has better adaptability to the contradictory relationship between tracking performance and lateral stability and has strong steering control robustness.

关键词： articulated vehicles (AVs) path-following algorithm closed-loop simulation preview optimal control

来源：评论

学校读者我要写书评

暂无评论

path-following algorithms for Beamforming and Signal Splitting in RF Energy Harvesting Networks

引用

IEEE COMMUNICATIONS LETTERS 2016年第8期20卷 1687-1690页

作者： Nasir, Ali A. Tuan, Hoang D. Ngo, Duy T. Durrani, Salman Kim, Dong In Natl Univ Sci & Technol Sch Elect Engn & Comp Sci Islamabad 44000 Pakistan Univ Technol Sydney Ctr Hlth Technol Ultimo NSW 2007 Australia Univ Newcastle Sch Elect Engn & Comp Sci Callaghan NSW 2308 Australia Australian Natl Univ Res Sch Engn Canberra ACT 2601 Australia Sungkyunkwan Univ Sch Informat & Commun Engn Suwon 440746 South Korea

We consider the joint design of transmit beamforming and receive signal-splitting ratios in the down-link of a wireless network with simultaneous radio frequency information and energy transfer. Under constraints on the signal-to-interference-plus-noise ratio at each user and the total transmit power at the base station, the design objective is to maximize either the sum harvested energy or the minimum harvested energy. We develop a computationally efficient path-following method to solve these challenging nonconvex optimization problems. We mathematically show that the proposed algorithms iteratively progress and converge to locally optimal solutions. Simulation results further show that these locally optimal solutions are the same as the globally optimal solutions for the considered practical network settings.

关键词： Energy harvesting nonconvex optimization path-following algorithm signal splitting transmit beamforming

来源：评论

学校读者我要写书评

暂无评论

Investigation of path-following algorithms for signomial geometric programming problems

引用

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 1997年第1期103卷 230-241页

作者： Yang, HH Bricker, DL UNIV IOWA DEPT IND ENGNIOWA CITYIA 52242

This paper considers signomial geometric programming (GP) dual problems, a class of nonconvex nonlinear programming problems possessing multiple locally optimal solutions, The primary purpose of this paper is to investigate the quality of solutions found by use of a path-following algorithm. The path-following method may be applied to either the original nonconvex problem, or to each of a sequence of convex posynomial GP problems approximating the original problem. For each test problem, the algorithms were initiated with thousands of different starting points. It was determined that, when the stopping criterion was relaxed for early posynomial GP problems in the sequence, the ultimate solution tended to be of better quality, and more frequently globally optimal. (C) 1997 Elsevier Science B.V.

关键词： interior point methods path-following algorithm geometric programming

来源：评论

学校读者我要写书评

暂无评论

Complexity of the primal-dual path-following algorithms for the weighted determinant maximization problems with linear matrix inequalities in the narrow neighbourhood

引用

OPTIMIZATION METHODS & SOFTWARE 2008年第3期23卷 421-440页

作者： Xia, Yu Univ Birmingham Sch Math Birmingham W Midlands England

Weighted determinant maximization with linear matrix inequality constraints (maxdet-problem) is a generalization of the semidefinite programming. We give a polynomial-time complexity analysis for the path-following interior-point short-step and predictor-corrector methods for the maxdet-problem based on symmetric Newton equations for certain classes of scaling matrices.

关键词： interior-point method determinant maximization semidefinite programming path-following algorithm complexity

来源：评论

学校读者我要写书评

暂无评论

path-following algorithms for Posynomial Geometric Programming Problems

引用

Journal of the Chinese Institute of Industrial Engineers 2000年第2期17卷 223-232页

作者： Hsu-Hao Yang [a]Department of Industrial Engineering and Management

Geometric programming (GP) is a class of optimization problems with a nonlinear objective function subject to a set of nonlinear constraints. The problems considered in this paper are posynomial GP problems, whose solutions can be obtained by solving a dual linear programing problem. The primary purpose of this paper is to investigate the quality of solutions found by, the application of a path-following algorithm, which is one of interior point methods. Two majorr approches to solve posynomial GP problems are investigated. One is dual GP as Generalized Lmear Programming (GLP) and the other is the traditional dual GP. The test results suggest that dual GP as GLP approach is advantageous over the posynomial one in the event that high a~curacy of the solution is required or critically important.

关键词： Interior point methods path-following algorithm geometric programming problem 內點法 path-following演算法幾何規劃問題

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：