检索结果-南通市图书馆

An Efficient Parameterized Logarithmic kernel function for Semidefinite Optimization

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Acta Mathematicae Applicatae Sinica 2020年第3期36卷 753-770页

作者： Louiza DERBAL Zakia KEBBICHE University of Ferhat Abbas Setif 1 Algeria

In this paper,we present a primal-dual interior point algorithm for semidefinite optimization problems based on a new class of kernel *** functions constitute a combination of the classic kernel function and a barrier *** derive the complexity bounds for large and small-update methods *** show that the best result of iteration bounds for large and small-update methods can be achieved,namely O(q√n(log√n)^q+1/q logn/ε)for large-update methods and O(q^3/2(log√q)^q+1/q√nlogn/ε)for small-update *** test the efficiency and the validity of our algorithm by running some computational tests,then we compare our numerical results with results obtained by algorithms based on different kernel functions.

关键词： kernel function interior-point algorithms semidefinite optimization complexity bound primaldual methods

A Large-update Interior-point Algorithm for Convex Quadratic Semi-definite Optimization Based on a New kernel function

在线全文

学校读者我要写书评

暂无评论

Acta Mathematica Sinica,English Series 2012年第11期28卷 2313-2328页

作者： Ming Wang ZHANG College of Science China Three Gorges University

In this paper, we present a large-update interior-point algorithm for convex quadratic semi-definite optimization based on a new kernel function. The proposed function is strongly convex. It is not self-regular function and also the usual logarithmic function. The goal of this paper is to investigate such a kernel function and show that the algorithm has favorable complexity bound in terms of the elegant analytic properties of the kernel function. The complexity bound is shown to be O（√n（logn）2 log e/n）. This bound is better than that by the classical primal-dual interior-point methods based on logarithmic barrier function and in optimization fields. Some computational results recent kernel functions introduced by some authors have been provided.

关键词： Convex quadratic semi-definite optimization kernel function interior-point algorithm^large-update method complexity

A Path-Following Full Newton-Step Infeasible Interior-Point Algorithm for P∗(κ)-HLCPs Based on a kernel function

在线全文

学校读者我要写书评

暂无评论

Journal of the Operations Research Society of China 2016年第1期4卷 77-96页

作者： Soodabeh Asadi Hossein Mansouri Maryam Zangiabadi Department of Applied Mathematics Faculty of Mathematical SciencesShahrekord UniversityP.O.Box 115ShahrekordIran

In this paper,we present a path-following infeasible interior-point method for P∗(κ)horizontal linear complementarity problems(P∗(κ)-HLCPs).The algorithm is based on a simple kernel function for finding the search directions and defining the neighborhood of the central *** algorithm follows the central path related to some perturbations of the original problem,using the so-called feasibility and centering steps,along with only full such ***,it has the advantage that the calculation of the step sizes at each iteration is *** complexity result shows that the full-Newton step infeasible interior-point algorithm based on the simple kernel function enjoys the best-known iteration complexity for P∗(κ)-HLCPs.

关键词： Horizontal linear complementarity problem Infeasible interior-point method Central path kernel function

A Large-Update Feasible Interior-Point Algorithm for Convex Quadratic Semi-definite Optimization Based on a New kernel function

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Journal of the Operations Research Society of China 2013年第3期1卷 359-376页

作者： B.Kheirfam F.Hasani Department of Mathematics Azarbaijan Shahid Madani UniversityTabrizIran

In this paper we present a large-update primal-dual interior-point algorithm for convex quadratic semi-definite optimization problems based on a new parametric kernel *** goal of this paper is to investigate such a kernel function and show that the algorithm has the best complexity *** complexity bound is shown to be O(√n log n log n/∈).

关键词： kernel function Interior-point algorithm Polynomial complexity Large-update methods

An approach of dynamic response analysis of nonlinear structures based on least square Volterra kernel function identification

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Transportation Safety and Environment 2023年第2期5卷 1-13页

作者： Zhenhao Zhang Jun Xiong Zhenpeng Zhao Fuming Wang Yi Zeng Bing Zhao Lu Ke School of Civil Engineering Changsha University of Science and TechnologyChangsha 410114HunanChina Guangxi Key Laboratory of Disaster Prevention and Engineering Safety Guangxi UniversityNanning 530004GuangxiChina College of Civil engineering and Architecture Guangxi UniversityNanning 530004GuangxiChina

Analysis of the dynamic response of a complex nonlinear system is always a difficult *** using Volterra functional series to describe a nonlinear system,its response analysis can be similar to using Fourier/Laplace transform and linear transfer function method to analyse a linear system’s *** this paper,a dynamic response analysis method for nonlinear systems based on Volterra series is ***,the recursive formula of the least square method is established to solve the Volterra kernel function vector,and the corresponding MATLAB programme is ***,the Volterra kernel vector corresponding to the nonlinear response of a structure under seismic excitation is identified,and the accuracy and applicability of using the kernel vector to predict the response of a nonlinear structure are *** results show that the Volterra kernel function identified by the derived recursive formula can accurately describe the nonlinear response characteristics of a structure under an *** a general nonlinear system,the first three order Volterra kernel function can relatively accurately express its nonlinear response *** addition,the obtained Volterra kernel function can be used to accurately predict the nonlinear response of a structure under the similar type of dynamic load.

关键词： nonlinear system Volterra series kernel function dynamic response least square method

A Full-Newton Step Feasible Interior-Point Algorithm for the Special Weighted Linear Complementarity Problems Based on a kernel function

在线全文

学校读者我要写书评

暂无评论

Wuhan University Journal of Natural Sciences 2024年第1期29卷 29-37页

作者： GENG Jie ZHANG Mingwang ZHU Dechun Mathematics Department Anhui Institute of Information TechnologyWuhu 241000AnhuiChina College of Science China Three Gorges UniversityYichang 443002HubeiChina

In this paper,a new full-Newton step primal-dual interior-point algorithm for solving the special weighted linear complementarity problem is designed and *** algorithm employs a kernel function with a linear growth term to derive the search direction,and by introducing new technical results and selecting suitable parameters,we prove that the iteration bound of the algorithm is as good as best-known polynomial complexity of interior-point ***,numerical results illustrate the efficiency of the proposed method.

关键词： interior-point algorithm weighted linear complementarity problem full-Newton step kernel function iteration complexity

A Full-Newton Step Feasible IPM for Semidefinite Optimization Based on a kernel function with Linear Growth Term

在线全文

学校读者我要写书评

暂无评论

Wuhan University Journal of Natural Sciences 2020年第6期25卷 501-509页

作者： GENG Jie ZHANG Mingwang PANG Jinjuan Mathematics Department Anhui Institute of Information TechnologyWuhu 241000AnhuiChina College of Science China Three Gorges UniversityYichang 443002HubeiChina

In this paper,we propose and analyze a full-Newton step feasible interior-point algorithm for semidefinite optimization based on a kernel function with linear growth *** kernel function is used both for determining the search directions and for measuring the distance between the given iterate and theμ-center for the *** developing a new norm-based proximity measure and some technical results,we derive the iteration bound that coincides with the currently best known iteration bound for the algorithm with small-update *** our knowledge,this result is the first instance of full-Newton step feasible interior-point method for SDO which involving the kernel function.

关键词： semidefinite optimization interior-point algorithm kernel function iteration complexity

Interior-Point Algorithm for Linear Optimization Based on a New kernel function

在线全文

学校读者我要写书评

暂无评论

Wuhan University Journal of Natural Sciences 2012年第1期17卷 12-18页

作者： CHEN Donghai ZHANG Mingwang LI Weihua College of Science China Three Gorges UniversityYichang 443002HubeiChina

In this paper, we design a primal-dual interior-point algorithm for linear optimization. Search directions and proximity function are proposed based on a new kernel function which includes neither growth term nor barrier term. Iteration bounds both for large-and small-update methods are derived, namely, O（nlog（n/c）） and O（√nlog（n/ε））. This new kernel function has simple algebraic expression and the proximity function has not been used before. Analogous to the classical logarithmic kernel function, our complexity analysis is easier than the other pri- mal-dual interior-point methods based on logarithmic barrier functions and recent kernel functions.

关键词： linear optimization interior-point algorithms pri- mal-dual methods kernel function polynomial complexity

Interior-point algorithm based on general kernel function for monotone linear complementarity problem

在线全文

学校读者我要写书评

暂无评论

Journal of Shanghai University(English Edition) 2009年第2期13卷 95-101页

作者：刘勇白延琴 Department of Mathematics College of SciencesShanghai UniversityShanghai 200444P.R.China

A polynomial interior-point algorithm is presented for monotone linear complementarity problem （MLCP） based on a class of kernel functions with the general barrier term, which are called general kernel functions. Under the mild conditions for the barrier term, the complexity bound of algorithm in terms of such kernel function and its derivatives is obtained. The approach is actually an extension of the existing work which only used the specific kernel functions for the MLCP.

关键词： monotone linear complementarity problem (MLCP) interior-point method kernel function polynomial complexity