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

12th International Conference on Fuzzy Systems and Knowledge Discovery (FSKD)

作者： Li, Yanfang Duan, Xibo Gu, Jia Shandong Coll Electon Technol Dept Basic Educ Jinan 250200 Peoples R China Shandong Water Polytech Dept Basic Sci Rizhao 276826 Peoples R China Shanghai Univ Engn Sci Coll Fundamental Studies Shanghai 201620 Peoples R China

ISBN: (纸本)9781467376822

In this article, we extend kernel-based interior point algorithms for linear programming to convex quadratic programming overs second-order cones. By means of Jordan algebras, we establish the iteration complexity for long-and short-step interior-point methods, namely, O (3 root N-2 log N/epsilon) and O (root N log N/epsilon), respectively. These results coincide with the ones obtained in the linear programming case.

关键词： convex quadratic programming Interior point algorithms Long- and short-step methods Jordan algebras iteration complexity

来源：评论

学校读者我要写书评

暂无评论

Efficient parameter estimation in biochemical pathways: Overcoming data limitations with constrained regularization and fuzzy inference

引用

EXPERT SYSTEMS WITH APPLICATIONS 2025年 259卷

作者： Bakshi, Abhisek Sengupta, Souvik De, Rajat K. Dasgupta, Abhijit Michelin India Pvt Ltd Dept Res & Dev Pune 411014 MH India Aliah Univ Dept Comp Sci & Engn Kolkata 700156 WB India Indian Stat Inst Machine Intelligence Unit Kolkata 700108 WB India St Jude Childrens Res Hosp Dept Struct Biol Memphis TN 38105 USA SRM Univ AP Dept Comp Sci & Engn Guntur 522240 AP India

In analytical modeling for biochemical pathways, precisely determining unknown parameters is paramount. Traditional methods, reliant on experimental time course data, often encounter roadblocks - limited accessibility and variable quality - that can significantly impact the algorithm's performance. In this study, we address these hurdles by unveiling a groundbreaking parameter estimation technique, Constrained Regularized Fuzzy Inferred Extended Kalman Filter (CRFIEKF). This innovative approach eliminates the need for experimental time-course measurements and capitalizes on the existing imprecise relationships among the molecules within the network. Our proposed framework integrates a Fuzzy Inference System (FIS) block to encapsulate these approximated relationships. To fine-tune the estimated parameter values, we employ Tikhonov regularization. The selection of Tikhonov regularization and Gaussian membership functions was based on the Mean Squared Error (MSE) values observed during the parameter estimation process, contrasting our results with those of previous studies. We rigorously tested the proposed approach across various pathways, from the glycolytic processes in mammalian erythrocytes and yeast cells to the intricate JAK/STAT and Ras signaling pathways. The results were impressive, showing a significant similarity (p-value < 0.001) to the outcomes of specific prior experiments. The dynamics of the biochemical networks normalized within the [0, 1] range mirrored the transient behavior (MSE < 0.5) of both in vivo and in silico results from previous studies. In conclusion, our findings highlight the effectiveness of CRFIEKF in estimating the kinetic parameter values without prior knowledge of experimental data within a biochemical pathway in the state-space model. The proposed method underscores its potential as a game-changer in biochemical pathway analysis.

关键词： State space model Fuzzy inference system Tikhonov regularization convex quadratic programming Ill-posed problem Kalman filter

来源：评论

学校读者我要写书评

暂无评论

凸二次规划的一个改进的Mehrotra型预估-校正算法

引用

高等学校计算数学学报 2011年第3期33卷 250-260页

作者：赵玉琴张明望周意元三峡大学理学院

引言自1984年Karmarkar提出[1]以来,内点算法成为最活跃的研究领域之一,至今取得了大量的成果.此外,人们开发了许多基于内点算法的优化软件包.预估-校正算法是最有效的内点算法之一,并且成为众多优化软件的核心算法.大部分数值实现都是基于

关键词： convex quadratic programming predictor-corrector method methrotra-type algorithm polynomial complexity.

来源：评论

学校读者我要写书评

暂无评论

A unified variational framework of no-tension and no-compression solids and its application to finite element analysis

引用

INTERNATIONAL JOURNAL OF SOLIDS AND STRUCTURES 2023年第1期275卷

作者： Lu, Mengkai Zhang, Liang Chen, Xingjie Vershinin, Anatoly Ningbo Univ Dept Mech Engn & Mech Ningbo 315211 Peoples R China Chongqing Univ Coll Aerosp Engn Chongqing 400044 Peoples R China Lomonosov Mosco State Univ Dept Math & Mech Moscow 119991 Russia

No-tension and no-compression constitutive models have important applications in solid mechanics, such as modelling of masonry, wrinkled membrane, unilateral contact interface, etc. Although lots of studies on no-tension and no-compression solids have been found, the variational principle constructing the cornerstone of elasticity is not studied thoroughly. The paper presents two concise variational formulations, a principle of minimum potential energy and a principle of minimum complementary energy, which are available both for no-tension and no-compression solids. Linearization of the conic yield surfaces leads to a series of linear comple-mentary constitutive equations that are embedded into the proposed variational framework. Differing from other variational formulations, an approximate total solution rather than the Newton iteration is achieved in finite element analysis. It makes the algorithm stable. The applications include a no-tension panel benchmark test, two masonry structures and a wrinkled membrane. Compared with our previous study on bi-modulus materials, the newly developed variational formulation is capable of capturing the evolution of wrinkles in membranes, and can be used for the analysis and design of wrinkle-free structures.

关键词： No-tension and no-compression Parametric variational principle Non-smooth yield function convex quadratic programming Evolution of wrinkles

来源：评论

学校读者我要写书评

暂无评论

Branch-Price-and-Cut Algorithms for the Vehicle Routing Problem with Stochastic and Correlated Travel Times

引用

OPERATIONS RESEARCH 2021年第2期69卷 436-455页

作者： Rostami, Borzou Desaulniers, Guy Errico, Fausto Lodi, Andrea Wilfrid Laurier Univ Lazaridis Sch Business & Econ Waterloo ON N2L 3C5 Canada Polytech Montreal Canada Excellence Res Chair CERC Data Sci Real Ti Montreal PQ H3C 3A7 Canada Polytech Montreal Dept Math & Ind Engn Montreal PQ H3C 3A7 Canada Grp Res Decis Anal GERAD Montreal PQ H3T 1J4 Canada Ecole Technol Super Montreal Dept Civil Engn Montreal PQ H3C 1K3 Canada Interuniv Res Ctr Enterprise Networks Logist & Tr Montreal PQ H3T 1J4 Canada

In this paper, we consider a version of the capacitated vehicle routing problem (CVRP) where travel times are assumed to be uncertain and statistically correlated (CVRP-SCT). In particular, we suppose that travel times follow a multivariate probability distribution whose first and second moments are known. The main purpose of the CVRP-CST is to plan vehicle routes whose travel times are reliable, in the sense that observed travel times are not excessively dispersed with respect to their expected value. To this scope we adopt a mean-variance approach, where routes with high travel time variability are penalized. This leads to a parametric binary quadratic program for which we propose two alternative set partitioning reformulations and show how to exploit the structure of the correlation matrix when there is correlation only between adjacent links. For each model, we develop an exact branch-price-and-cut algorithm, where the quadratic component is dealt with either in the column generation master problem or in its subproblem. We tested our algorithms on a rich collection of instances derived from well-known data sets. Computational results show that our algorithms can efficiently solve problem instances with up to 75 customers. Furthermore, the obtained solutions significantly reduce the time variability when compared with standard CVRP solutions.

关键词： vehicle routing uncertain travel times correlation convex quadratic programming branch-price-and-cut

来源：评论

学校读者我要写书评

暂无评论

ON COMPUTING THE CENTER OF A convex quadraticALLY CONSTRAINED SET

引用

MATHEMATICAL programming 1991年第1期50卷 81-89页

作者： MEHROTRA, S SUN, J 1. Department of Industrial Engineering and Management Sciences Northwestern University 60208 Evanston IL USA

We propose a method for finding analytic center of a convex feasible region whose boundaries are defined by quadratic functions. The algorithm starts from an arbitrary initial point and approaches to the desired center by simultaneously reducing infeasibility or slackness of all constraints. A partial Newton step is taken at each iteration.

关键词： ANALYTIC CENTER convex quadratic programming INTERIOR POINT METHODS quadratic CONSTRAINTS

来源：评论

学校读者我要写书评

暂无评论

A conjugate direction based simplicial decomposition framework for solving a specific class of dense convex quadratic programs

引用

COMPUTATIONAL OPTIMIZATION AND APPLICATIONS 2020年第2期75卷 321-360页

作者： Bettiol, Enrico Letocart, Lucas Rinaldi, Francesco Traversi, Emiliano Univ Paris 13 UMR7030 Sorbonne Paris Cite LIPNCNRS 99 Ave JB Clement F-93430 Villetaneuse France Univ Padua Dipartimento Matemat Tullio Levi Civita Via Trieste63 I-35121 Padua Italy

Many real-world applications can usually be modeled as convex quadratic problems. In the present paper, we want to tackle a specific class of quadratic programs having a dense Hessian matrix and a structured feasible set. We hence carefully analyze a simplicial decomposition like algorithmic framework that handles those problems in an effective way. We introduce a new master solver, called Adaptive Conjugate Direction Method, and embed it in our framework. We also analyze the interaction of some techniques for speeding up the solution of the pricing problem. We report extensive numerical experiments based on a benchmark of almost 1400 instances from specific and generic quadratic problems. We show the efficiency and robustness of the method when compared to a commercial solver (Cplex).

关键词： Simplicial decomposition convex quadratic programming Dense Hessian matrix Column generation

来源：评论

学校读者我要写书评

暂无评论

Perturbing the dual feasible region for solving convex quadratic programs

引用

JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS 1997年第1期94卷 73-85页

作者： Fang, SC Tsao, HSJ UNIV CALIF BERKELEY INST TRANSPORTAT STUDIES BERKELEY CA 94720 USA

A dual l(p)-norm perturbation approach is introduced for solving convex quadratic programming problems. The feasible region of the Lagrangian dual program is approximated by a proper subset that is defined by a single smooth convex constraint involving the l(p)-norm of a vector measure of constraint violation. It is shown that the perturbed dual program becomes the dual program as p --> infinity and, under some standard conditions, the optimal solution of the perturbed dual program converges to a dual optimal solution. A closed-form formula that converts an optimal solution of the perturbed dual program into a feasible solution of the primal convex quadratic program is also provided. Such primal feasible solutions converge to an optimal primal solution as p --> infinity. The proposed approach generalizes the previously proposed primal perturbation approach with an entropic barrier function. Its theory specializes easily for linear programming.

关键词： convex quadratic programming duality theory perturbation methods

来源：评论

学校读者我要写书评

暂无评论

Numerical methods of nonlinear optimal control based on mathematical programming

引用

NONLINEAR ANALYSIS-THEORY METHODS & APPLICATIONS 1997年第6期30卷 3843-3854页

作者： Ito, S Inst Stat Math Dept Predect & Control Minato Ku Tokyo 106 Japan

No abstract available

关键词： optimal control interior point method convex quadratic programming inexact Newton method quasi-Newton method sequential quadratic programming nonlinear programming infinite programming

来源：评论

学校读者我要写书评

暂无评论

Trajectory Planning of Free-Floating Space Manipulators With Spacecraft Attitude Stabilization and Manipulability Optimization

引用

IEEE TRANSACTIONS ON SYSTEMS MAN CYBERNETICS-SYSTEMS 2021年第12期51卷 7346-7362页

作者： Lu, Xuhui Jia, Yingmin Beihang Univ BUAA Sch Automat Sci & Elect Engn Res Div 7 Beijing 100191 Peoples R China Beihang Univ BUAA Sch Automat Sci & Elect Engn Ctr Informat & Control Beijing 100191 Peoples R China

This article focuses on trajectory planning of the free-floating space manipulator (FFSM), so that the end-effector trajectory tracking and the spacecraft attitude stabilization are achieved simultaneously. A novel spacecraft attitude stabilization constraint with the time-decaying term and the time-varying gaining parameter is constructed, such that not only is the designed constraint satisfied at the initial instant but also the spacecraft attitude can converge into the small neighborhood of the desired attitude. Two constraints on joint accelerations are constructed, such that the constraints on joint angles/velocities/accelerations and the requirement on the end-effector trajectory tracking are both satisfied. Besides, for the cost function with the control efforts and the manipulability optimization, it can be equivalently converted as a strictly convex quadratic function. Correspondingly, the trajectory planning problem of the FFSM at the acceleration level can be formulated as a constrained convex quadratic programming problem. The proposed trajectory planning algorithm avoids the dynamic singularity of the FFSM. The effectiveness of the proposed algorithm is validated by the simulation results.

关键词： Space vehicles Trajectory planning End effectors Optimization Trajectory Manipulator dynamics convex quadratic programming manipulability optimization spacecraft attitude stabilization trajectory planning of space manipulator

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：