期刊文献+
共找到12,943篇文章
< 1 2 250 >
每页显示 20 50 100
A Combined Homotopy Interior Point Method for Nonconvex Programming with Pseudo Cone Condition 被引量:13
1
作者 于波 刘庆怀 +1 位作者 冯果忱 孙以丰 《Northeastern Mathematical Journal》 CSCD 2000年第4期383-386,共4页
关键词 nonconvex programming interior point method homotopy method
在线阅读 下载PDF
A Combined Homotopy Infeasible Interior-Point Method for Convex Nonlinear Programming 被引量:3
2
作者 杨轶华 吕显瑞 刘庆怀 《Northeastern Mathematical Journal》 CSCD 2006年第2期188-192,共5页
In this paper, on the basis of the logarithmic barrier function and KKT conditions, we propose a combined homotopy infeasible interior-point method (CHIIP) for convex nonlinear programming problems. For any convex n... In this paper, on the basis of the logarithmic barrier function and KKT conditions, we propose a combined homotopy infeasible interior-point method (CHIIP) for convex nonlinear programming problems. For any convex nonlinear programming, without strict convexity for the logarithmic barrier function, we get different solutions of the convex programming in different cases by CHIIP method. 展开更多
关键词 convex nonlinear programming infeasible interior point method homotopy method global convergence
在线阅读 下载PDF
Dynamic economic dispatch combining network flow and interior point method 被引量:1
3
作者 韩学山 赵建国 柳焯 《Journal of Harbin Institute of Technology(New Series)》 EI CAS 2003年第4期461-466,共6页
Under the environment of electric power market, economic dispatch (ED) problem should consider network constraints, unit ramp rates, besides the basic constraints. For this problem, it is important to establish the ef... Under the environment of electric power market, economic dispatch (ED) problem should consider network constraints, unit ramp rates, besides the basic constraints. For this problem, it is important to establish the effective model and algorithm. This paper examines the decoupled conditions that affect the solution optimality to this problem. It proposes an effective model and solution method. Based on the look-ahead technique, it finds the number of time intervals to guarantee the solution optimality. Next, an efficient technique for finding the optimal solution via the interior point methods is described. Test cases, which include dispatching six units over 5 time intervals on the IEEE 30 test system with line flows and ramp constraints are presented. Results indicate that the computational effort as measured by iteration counts or execution time varies only modestly with the problem size. 展开更多
关键词 Economic dispatch OPTIMIZATION network constraints ramp constraints interior point method
在线阅读 下载PDF
Element-free Galerkin method for free vibration of rectangular plates with interior elastic point supports and elastically restrained edges 被引量:1
4
作者 王砚 王忠民 阮苗 《Journal of Shanghai University(English Edition)》 CAS 2010年第3期187-195,共9页
The element-free Galerkin method is proposed to solve free vibration of rectangular plates with finite interior elastic point supports and elastically restrained edges.Based on the extended Hamilton's principle for t... The element-free Galerkin method is proposed to solve free vibration of rectangular plates with finite interior elastic point supports and elastically restrained edges.Based on the extended Hamilton's principle for the elastic dynamics system,the dimensionless equations of motion of rectangular plates with finite interior elastic point supports and the edge elastically restrained are established using the element-free Galerkin method.Through numerical calculation,curves of the natural frequency of thin plates with three edges simply supported and one edge elastically restrained,and three edges clamped and the other edge elastically restrained versus the spring constant,locations of elastic point support and the elastic stiffness of edge elastically restrained are obtained.Effects of elastic point supports and edge elastically restrained on the free vibration characteristics of the thin plates are analyzed. 展开更多
关键词 element free method rectangular thin plates interior elastic point supports elastically restrained edges free vibration
在线阅读 下载PDF
A New Infeasible Interior-point Method for Linear Complementarity Problem Based on Full Newton Step 被引量:1
5
作者 龚小玉 胡振鹏 王先甲 《Chinese Quarterly Journal of Mathematics》 CSCD 2012年第4期624-632,共9页
This paper proposes an infeasible interior-point algorithm with full-Newton step for linear complementarity problem,which is an extension of Roos about linear optimization. The main iteration of the algorithm consists... This paper proposes an infeasible interior-point algorithm with full-Newton step for linear complementarity problem,which is an extension of Roos about linear optimization. The main iteration of the algorithm consists of a feasibility step and several centrality steps. At last,we prove that the algorithm has O(nlog n/ε) polynomial complexity,which coincides with the best known one for the infeasible interior-point algorithm at present. 展开更多
关键词 complementarity problem infeasible interior-point methods full-Newton step polynomial complexity
在线阅读 下载PDF
Geo-interface modeling with material point method: A review 被引量:1
6
作者 Tiancheng Xie Honghu Zhu +4 位作者 Youkou Dong Mingliang Zhou Bin Wang Wei Zhang Jidong Zhao 《Journal of Rock Mechanics and Geotechnical Engineering》 2025年第6期3950-3972,共23页
Geo-interfaces refer to the contact surfaces between multiple media within geological strata,as well as the transition zones that regulate the migration of three-phase matter,changes in physical states,and the deforma... Geo-interfaces refer to the contact surfaces between multiple media within geological strata,as well as the transition zones that regulate the migration of three-phase matter,changes in physical states,and the deformation and stability of rock and soil masses.Owing to the combined effects of natural factors and human activities,geo-interfaces play crucial roles in the emergence,propagation,and triggering of geological disasters.Over the past three decades,the material point method(MPM)has emerged as a preferred approach for addressing large deformation problems and simulating soil-water-structure interactions,making it an ideal tool for analyzing geo-interface behaviors.In this review,we offer a systematic summary of the basic concepts,classifications,and main characteristics of the geo-interface,and provide a comprehensive overview of recent advances and developments in simulating geo-interface using the MPM.We further present a brief description of various MPMs for modeling different types of geo-interfaces in geotechnical engineering applications and highlight the existing limitations and future research directions.This study aims to facilitate innovative applications of the MPM in modeling complex geo-interface problems,providing a reference for geotechnical practitioners and researchers. 展开更多
关键词 Geo-interface Material point method(MPM) Interaction mechanism Large deformation Numerical simulation
在线阅读 下载PDF
Optimal Adjustment Algorithm for <i>p</i>Coordinates and The Starting Point in Interior Point Methods 被引量:1
7
作者 Carla T. L. S. Ghidini Aurelio R. L. Oliveira Jair Silva 《American Journal of Operations Research》 2011年第4期191-202,共12页
Optimal adjustment algorithm for p coordinates is a generalization of the optimal pair adjustment algorithm for linear programming, which in turn is based on von Neumann’s algorithm. Its main advantages are simplicit... Optimal adjustment algorithm for p coordinates is a generalization of the optimal pair adjustment algorithm for linear programming, which in turn is based on von Neumann’s algorithm. Its main advantages are simplicity and quick progress in the early iterations. In this work, to accelerate the convergence of the interior point method, few iterations of this generalized algorithm are applied to the Mehrotra’s heuristic, which determines the starting point for the interior point method in the PCx software. Computational experiments in a set of linear programming problems have shown that this approach reduces the total number of iterations and the running time for many of them, including large-scale ones. 展开更多
关键词 Von Neumann’s ALGORITHM Mehrotra’s HEURISTIC interior point methods Linear Programming
在线阅读 下载PDF
A Primal-dual Interior Point Method for Nonlinear Programming 被引量:1
8
作者 张珊 姜志侠 《Northeastern Mathematical Journal》 CSCD 2008年第3期275-282,共8页
In this paper, we propose a primal-dual interior point method for solving general constrained nonlinear programming problems. To avoid the situation that the algorithm we use may converge to a saddle point or a local ... In this paper, we propose a primal-dual interior point method for solving general constrained nonlinear programming problems. To avoid the situation that the algorithm we use may converge to a saddle point or a local maximum, we utilize a merit function to guide the iterates toward a local minimum. Especially, we add the parameter ε to the Newton system when calculating the decrease directions. The global convergence is achieved by the decrease of a merit function. Furthermore, the numerical results confirm that the algorithm can solve this kind of problems in an efficient way. 展开更多
关键词 primal-dual interior point algorithm merit function global convergence nonlinear programming
在线阅读 下载PDF
A NEW FRAMEWORK OF PRIMAL-DUAL INFEASIBLE INTERIOR-POINT METHOD FOR LINEAR PROGRAMMING
9
作者 林正华 宋岱才 刘庆怀 《Numerical Mathematics A Journal of Chinese Universities(English Series)》 SCIE 1998年第2期183-194,共12页
On the basis of the formulations of the logarithmic barrier function and the idea of following the path of minimizers for the logarithmic barrier family of problems the so called "centralpath" for linear pro... On the basis of the formulations of the logarithmic barrier function and the idea of following the path of minimizers for the logarithmic barrier family of problems the so called "centralpath" for linear programming, we propose a new framework of primal-dual infeasible interiorpoint method for linear programming problems. Without the strict convexity of the logarithmic barrier function, we get the following results: (a) if the homotopy parameterμcan not reach to zero,then the feasible set of these programming problems is empty; (b) if the strictly feasible set is nonempty and the solution set is bounded, then for any initial point x, we can obtain a solution of the problems by this method; (c) if the strictly feasible set is nonempty and the solution set is unbounded, then for any initial point x, we can obtain a (?)-solution; and(d) if the strictly feasible set is nonempty and the solution set is empty, then we can get the curve x(μ), which towards to the generalized solutions. 展开更多
关键词 Linear PROGRAMMING infeasible interior-point method HOMOTOPY method global convergence.
在线阅读 下载PDF
Solving Fixed Point Problems in More General Nonconvex Sets Via an Interior Point Homotopy Method
10
作者 SU Meng-long LIU Mai-xue 《Chinese Quarterly Journal of Mathematics》 CSCD 2012年第1期74-78,共5页
In this paper,we are mainly devoted to solving fixed point problems in more general nonconvex sets via an interior point homotopy method.Under suitable conditions,a constructive proof is given to prove the existence o... In this paper,we are mainly devoted to solving fixed point problems in more general nonconvex sets via an interior point homotopy method.Under suitable conditions,a constructive proof is given to prove the existence of fixed points,which can lead to an implementable globally convergent algorithm. 展开更多
关键词 nonconvex sets interior point homotopy method
在线阅读 下载PDF
Globally Convergent Interior Point Methods for Variational Inequalities in Unbounded Sets
11
作者 徐庆 于波 +1 位作者 冯果忱 李荣华 《Northeastern Mathematical Journal》 CSCD 2002年第1期9-12,共4页
The finite-dimensional variational inequality problem (VIP) has been studied extensively in the literature because of its successful applications in many fields such as economics, transportation, regional science and ... The finite-dimensional variational inequality problem (VIP) has been studied extensively in the literature because of its successful applications in many fields such as economics, transportation, regional science and operations research. Barker and Pang[1] have given an excellent survey of theories, methods and applications of VIPs. 展开更多
关键词 variational inequality homotopy method interior point method
在线阅读 下载PDF
A material point finite element method for thermo-hydro-mechanical modeling in poro-elastic media with brittle fracturing
12
作者 Zhaonan Wang Louis Ngai Yuen Wong 《Journal of Rock Mechanics and Geotechnical Engineering》 2025年第6期3299-3315,共17页
In this study,a powerful thermo-hydro-mechanical(THM)coupling solution scheme for saturated poroelastic media involving brittle fracturing is developed.Under the local thermal non-equilibrium(LTNE)assumption,this sche... In this study,a powerful thermo-hydro-mechanical(THM)coupling solution scheme for saturated poroelastic media involving brittle fracturing is developed.Under the local thermal non-equilibrium(LTNE)assumption,this scheme seamlessly combines the material point method(MPM)for accurately tracking solid-phase deformation and heat transport,and the Eulerian finite element method(FEM)for effectively capturing fluid flow and heat advection-diffusion behavior.The proposed approach circumvents the substantial challenges posed by large nonlinear equation systems with the monolithic solution scheme.The staggered solution process strategically separates each physical field through explicit or implicit integration.The characteristic-based method is used to stabilize advection-dominated heat flows for efficient numerical implementation.Furthermore,a fractional step approach is employed to decompose fluid velocity and pressure,thereby suppressing pore pressure oscillation on the linear background grid.The fracturing initiation and propagation are simulated by a rate-dependent phase field model.Through a series of quasi-static and transient simulations,the exceptional performance and promising potential of the proposed model in addressing THM fracturing problems in poro-elastic media is demonstrated. 展开更多
关键词 Thermo-hydro-mechanical(THM)coupling Local thermal non-equilibrium(LTNE) Material point method(MPM) Characteristic-based method Phase field model
在线阅读 下载PDF
Sensitivity Analysis of Structural Dynamic Behavior Based on the Sparse Polynomial Chaos Expansion and Material Point Method
13
作者 Wenpeng Li Zhenghe Liu +4 位作者 Yujing Ma Zhuxuan Meng Ji Ma Weisong Liu Vinh Phu Nguyen 《Computer Modeling in Engineering & Sciences》 2025年第2期1515-1543,共29页
This paper presents a framework for constructing surrogate models for sensitivity analysis of structural dynamics behavior.Physical models involving deformation,such as collisions,vibrations,and penetration,are devel-... This paper presents a framework for constructing surrogate models for sensitivity analysis of structural dynamics behavior.Physical models involving deformation,such as collisions,vibrations,and penetration,are devel-oped using the material point method.To reduce the computational cost of Monte Carlo simulations,response surface models are created as surrogate models for the material point system to approximate its dynamic behavior.An adaptive randomized greedy algorithm is employed to construct a sparse polynomial chaos expansion model with a fixed order,effectively balancing the accuracy and computational efficiency of the surrogate model.Based on the sparse polynomial chaos expansion,sensitivity analysis is conducted using the global finite difference and Sobol methods.Several examples of structural dynamics are provided to demonstrate the effectiveness of the proposed method in addressing structural dynamics problems. 展开更多
关键词 Structural dynamics DEFORMATION material point method sparse polynomial chaos expansion adaptive randomized greedy algorithm sensitivity analysis
在线阅读 下载PDF
Interior-Point Methods Applied to the Predispatch Problem of a Hydroelectric System with Scheduled Line Manipulations
14
作者 Silvia M. S. Carvalho Aurelio R. L. Oliveira 《American Journal of Operations Research》 2012年第2期266-271,共6页
Transmission line manipulations in a power system are necessary for the execution of preventative or corrective main- tenance in a network, thus ensuring the stability of the system. In this study, primal-dual interio... Transmission line manipulations in a power system are necessary for the execution of preventative or corrective main- tenance in a network, thus ensuring the stability of the system. In this study, primal-dual interior-point methods are used to minimize costs and losses in the generation and transmission of the predispatch active power flow in a hydroelectric system with previously scheduled line manipulations for preventative maintenance, over a period of twenty-four hours. The matrix structure of this problem and the modification that it imposes on the system is also broached in this study. From the computational standpoint, the effort required to solve a problem with or without line manipulations is similar, and the reasons for this are also discussed in this study. Computational results sustain our findings. 展开更多
关键词 interior-point methods Scheduled LINE MANIPULATIONS Hydroelectric Systems The BRAZILIAN Power System
暂未订购
Kernel Function-Based Primal-Dual Interior-Point Methods for Symmetric Cones Optimization
15
作者 ZHAO Dequan ZHANG Mingwang 《Wuhan University Journal of Natural Sciences》 CAS 2014年第6期461-468,共8页
In this paper, we present a large-update primal-dual interior-point method for symmetric cone optimization(SCO) based on a new kernel function, which determines both search directions and the proximity measure betwe... In this paper, we present a large-update primal-dual interior-point method for symmetric cone optimization(SCO) based on a new kernel function, which determines both search directions and the proximity measure between the iterate and the center path. The kernel function is neither a self-regular function nor the usual logarithmic kernel function. Besides, by using Euclidean Jordan algebraic techniques, we achieve the favorable iteration complexity O( √r(1/2)(log r)^2 log(r/ ε)), which is as good as the convex quadratic semi-definite optimization analogue. 展开更多
关键词 symmetric cones optimization Kernel function interior-point method polynomial complexity
原文传递
Power Generation Expansion Planning Using an Interior Point with Cutting Plane (IP/CP) Method
16
作者 Moon, Guk-Hyun Seo, In-Yong Jaehee, Lee 《Journal of Mechanics Engineering and Automation》 2015年第11期640-645,共6页
The generation expansion planning is one of complex mixed-integer optimization problems, which involves a large number of continuous or discrete decision variables and constraints. In this paper, an interior point wit... The generation expansion planning is one of complex mixed-integer optimization problems, which involves a large number of continuous or discrete decision variables and constraints. In this paper, an interior point with cutting plane (IP/CP) method is proposed to solve the mixed-integer optimization problem of the electrical power generation expansion planning. The IP/CP method could improve the overall efficiency of the solution and reduce the computational time. Proposed method is combined with the Bender's decomposition technique in order to decompose the generation expansion problem into a master investment problem and a slave operational problem. The numerical example is presented to compare with the effectiveness of the proposed algorithm. 展开更多
关键词 Benders' decomposition technique power generation expansion planning interior point with cutting plane method mixed integer programming.
在线阅读 下载PDF
Low-order Wavefront Error Compensation for Multi-field of Lithography Projection Objective Based on Interior Point Method
17
作者 LU Yutong ZHOU Ji +4 位作者 KANG Xia ZHU Xianchang LIU Junbo WANG Jian HU Song 《Instrumentation》 2022年第3期43-50,共8页
Low-order wavefront error account for a large proportion of wave aberrations.A compensation method for low order aberration of projection lithography objective based on Interior Point Method is presented.Compensation ... Low-order wavefront error account for a large proportion of wave aberrations.A compensation method for low order aberration of projection lithography objective based on Interior Point Method is presented.Compensation model between wavefront error and degree of movable lens freedom is established.Converting over-determined system to underdetermined system,the compensation is solved by Interior Point Method(IPM).The presented method is compared with direct solve the over-determined system.Then,other algorithm GA,EA and PS is compared with IPM.Simulation and experimental results show that the presented compensation method can obtained compensation with less residuals compared with direct solve the over-determined system.Also,the presented compensation method can reduce computation time and obtain results with less residuals compare with AGA,EA and PS.Moreover,after compensation,RMS of wavefront error of the experimental lithography projection objective decrease from 56.05 nm to 17.88 nm. 展开更多
关键词 Wavefront Error Compensation Lithography Projection Objective interior point method Computer Aided Alignment
原文传递
Projectile impact point prediction method based on GRNN 被引量:9
18
作者 黄鑫 赵捍东 《Journal of Measurement Science and Instrumentation》 CAS CSCD 2016年第1期7-12,2,共6页
In order to forecast projectile impact points quickly and accurately,aprojectile impact point prediction method based on generalized regression neural network(GRNN)is presented.Firstly,the model of GRNN forecasting ... In order to forecast projectile impact points quickly and accurately,aprojectile impact point prediction method based on generalized regression neural network(GRNN)is presented.Firstly,the model of GRNN forecasting impact point is established;secondly,the particle swarm algorithm(PSD)is used to optimize the smooth factor in the prediction model and then the optimal GRNN impact point prediction model is obtained.Finally,the numerical simulation of this prediction model is carried out.Simulation results show that the maximum range error is no more than 40 m,and the lateral deviation error is less than0.2m.The average time of impact point prediction is 6.645 ms,which is 1 300.623 ms less than that of numerical integration method.Therefore,it is feasible and effective for the proposed method to forecast projectile impact points,and thus it can provide a theoretical reference for practical engineering applications. 展开更多
关键词 trajectory correction impact point prediction generalized regression neural network(GRNN) numerical integra-tion method
在线阅读 下载PDF
A new primal-dual interior-point algorithm for convex quadratic optimization 被引量:9
19
作者 王国强 白延琴 +1 位作者 刘勇 张敏 《Journal of Shanghai University(English Edition)》 CAS 2008年第3期189-196,共8页
In this paper, a new primal-dual interior-point algorithm for convex quadratic optimization (CQO) based on a kernel function is presented. The proposed function has some properties that are easy for checking. These ... In this paper, a new primal-dual interior-point algorithm for convex quadratic optimization (CQO) based on a kernel function is presented. The proposed function has some properties that are easy for checking. These properties enable us to improve the polynomial complexity bound of a large-update interior-point method (IPM) to O(√n log nlog n/e), which is the currently best known polynomial complexity bound for the algorithm with the large-update method. Numerical tests were conducted to investigate the behavior of the algorithm with different parameters p, q and θ, where p is the growth degree parameter, q is the barrier degree of the kernel function and θ is the barrier update parameter. 展开更多
关键词 convex quadratic optimization (CQO) interior-point methods (IPMs) large-update method polynomial complexity
在线阅读 下载PDF
A class of polynomial primal-dual interior-point algorithms for semidefinite optimization 被引量:6
20
作者 王国强 白延琴 《Journal of Shanghai University(English Edition)》 CAS 2006年第3期198-207,共10页
In the present paper we present a class of polynomial primal-dual interior-point algorithms for semidefmite optimization based on a kernel function. This kernel function is not a so-called self-regular function due to... In the present paper we present a class of polynomial primal-dual interior-point algorithms for semidefmite optimization based on a kernel function. This kernel function is not a so-called self-regular function due to its growth term increasing linearly. Some new analysis tools were developed which can be used to deal with complexity "analysis of the algorithms which use analogous strategy in [5] to design the search directions for the Newton system. The complexity bounds for the algorithms with large- and small-update methodswere obtained, namely,O(qn^(p+q/q(P+1)log n/ε and O(q^2√n)log n/ε,respectlvely. 展开更多
关键词 semidefinite optimization (SDO) primal-dual interior-point methods large- and small-update methods polynomial complexity
在线阅读 下载PDF
上一页 1 2 250 下一页 到第
使用帮助 返回顶部