期刊文献+
共找到129篇文章
< 1 2 7 >
每页显示 20 50 100
Sequential quadratic programming-based non-cooperative target distributed hybrid processing optimization method 被引量:2
1
作者 SONG Xiaocheng WANG Jiangtao +3 位作者 WANG Jun SUN Liang FENG Yanghe LI Zhi 《Journal of Systems Engineering and Electronics》 SCIE EI CSCD 2023年第1期129-140,共12页
The distributed hybrid processing optimization problem of non-cooperative targets is an important research direction for future networked air-defense and anti-missile firepower systems. In this paper, the air-defense ... The distributed hybrid processing optimization problem of non-cooperative targets is an important research direction for future networked air-defense and anti-missile firepower systems. In this paper, the air-defense anti-missile targets defense problem is abstracted as a nonconvex constrained combinatorial optimization problem with the optimization objective of maximizing the degree of contribution of the processing scheme to non-cooperative targets, and the constraints mainly consider geographical conditions and anti-missile equipment resources. The grid discretization concept is used to partition the defense area into network nodes, and the overall defense strategy scheme is described as a nonlinear programming problem to solve the minimum defense cost within the maximum defense capability of the defense system network. In the solution of the minimum defense cost problem, the processing scheme, equipment coverage capability, constraints and node cost requirements are characterized, then a nonlinear mathematical model of the non-cooperative target distributed hybrid processing optimization problem is established, and a local optimal solution based on the sequential quadratic programming algorithm is constructed, and the optimal firepower processing scheme is given by using the sequential quadratic programming method containing non-convex quadratic equations and inequality constraints. Finally, the effectiveness of the proposed method is verified by simulation examples. 展开更多
关键词 non-cooperative target distributed hybrid processing multiple constraint minimum defense cost sequential quadratic programming
下载PDF
Priority approach based on quadratic programming model to fuzzy preference relation 被引量:1
2
作者 徐泽水 达庆利 陈琦 《Journal of Southeast University(English Edition)》 EI CAS 2005年第1期108-110,共3页
We investigate the decision-making problem with a finite set of alternatives,in which the decision information takes the form of a fuzzy preference relation. We develop asimple and practical approach to obtaining the ... We investigate the decision-making problem with a finite set of alternatives,in which the decision information takes the form of a fuzzy preference relation. We develop asimple and practical approach to obtaining the priority vector of a fuzzy preference relation. Theprominent characteristic of the developed approach is that the priority vector can generally beobtained by a simple formula, which is derived from a quadratic programming model. We utilize theconsistency ratio to check the consistency of fuzzy preference relation. If the fuzzy preferencerelation is of unacceptable consistency, then we can return it to the decision maker to reconsiderstructuring a new fuzzy preference relation until the fuzzy preference relation with acceptableconsistency is obtained. We finally illustrate the priority approach by two numerical examples. Thenumerical results show that the developed approach is straightforward, effective, and can easily beperformed on a computer. 展开更多
关键词 decision making fuzzy preference relation quadratic programming PRIORITY
下载PDF
A COMBINED PARAMETRIC QUADRATIC PROGRAMMING AND PRECISE INTEGRATION METHOD BASED DYNAMIC ANALYSIS OF ELASTIC-PLASTIC HARDENING/SOFTENING PROBLEMS 被引量:3
3
作者 张洪武 张新伟 《Acta Mechanica Sinica》 SCIE EI CAS CSCD 2002年第6期638-648,共11页
The objective of the paper is to develop a new algorithm for numerical solution of dynamic elastic-plastic strain hardening/softening problems. The gradient dependent model is adopted in the numerical model to overcom... The objective of the paper is to develop a new algorithm for numerical solution of dynamic elastic-plastic strain hardening/softening problems. The gradient dependent model is adopted in the numerical model to overcome the result mesh-sensitivity problem in the dynamic strain softening or strain localization analysis. The equations for the dynamic elastic-plastic problems are derived in terms of the parametric variational principle, which is valid for associated, non-associated and strain softening plastic constitutive models in the finite element analysis. The precise integration method, which has been widely used for discretization in time domain of the linear problems, is introduced for the solution of dynamic nonlinear equations. The new algorithm proposed is based on the combination of the parametric quadratic programming method and the precise integration method and has all the advantages in both of the algorithms. Results of numerical examples demonstrate not only the validity, but also the advantages of the algorithm proposed for the numerical solution of nonlinear dynamic problems. 展开更多
关键词 precise integration method parametric quadratic programming method strain localization strain softening dynamic response
下载PDF
A POLYNOMIAL PREDICTOR-CORRECTOR INTERIOR-POINT ALGORITHM FOR CONVEX QUADRATIC PROGRAMMING 被引量:4
4
作者 余谦 黄崇超 江燕 《Acta Mathematica Scientia》 SCIE CSCD 2006年第2期265-270,共6页
This article presents a polynomial predictor-corrector interior-point algorithm for convex quadratic programming based on a modified predictor-corrector interior-point algorithm. In this algorithm, there is only one c... This article presents a polynomial predictor-corrector interior-point algorithm for convex quadratic programming based on a modified predictor-corrector interior-point algorithm. In this algorithm, there is only one corrector step after each predictor step, where Step 2 is a predictor step and Step 4 is a corrector step in the algorithm. In the algorithm, the predictor step decreases the dual gap as much as possible in a wider neighborhood of the central path and the corrector step draws iteration points back to a narrower neighborhood and make a reduction for the dual gap. It is shown that the algorithm has O(√nL) iteration complexity which is the best result for convex quadratic programming so far. 展开更多
关键词 Convex quadratic programming PREDICTOR-CORRECTOR interior-point algorithm
下载PDF
An Interval Maximum Entropy Method for Quadratic Programming Problem 被引量:3
5
作者 RUI Wen-juan CAO De-xin SONG Xie-wu 《Journal of China University of Mining and Technology》 2005年第4期379-383,共5页
With the idea of maximum entropy function and penalty function methods, we transform the quadratic programming problem into an unconstrained differentiable optimization problem, discuss the interval extension of the m... With the idea of maximum entropy function and penalty function methods, we transform the quadratic programming problem into an unconstrained differentiable optimization problem, discuss the interval extension of the maximum entropy function, provide the region deletion test rules and design an interval maximum entropy algorithm for quadratic programming problem. The convergence of the method is proved and numerical results are presented. Both theoretical and numerical results show that the method is reliable and efficient. 展开更多
关键词 quadratic programming interval algorithm penalty function maximum entropy function
下载PDF
A Quadratic Programming Model for Blast Scheduling 被引量:1
6
作者 Chunyan Meng Samuel Frimpong Mingjian Zuo(Ph. D. Student (correspondent). 606-Chemical-Mineral Building. Dept of Civil and Environmental Engineering. University of Alberta. T6G 2G6.Edmonton, AB. Canada)(Associate protessor, School of Mining and Petrole 《International Journal of Minerals,Metallurgy and Materials》 SCIE EI CAS CSCD 1999年第3期165-167,共3页
A quadratic programming model is established to choose the blocks to be blasted in a given period. The length of this period depends on the production planning requirements. During the given period, the blocks' pa... A quadratic programming model is established to choose the blocks to be blasted in a given period. The length of this period depends on the production planning requirements. During the given period, the blocks' parameters are available from the geological database of the mine. The objective is to minimize the deviation of the average ore grade of blasted blocks from the standard ore grade required by the mill. Transportation ability constraint. production quantity demand constraint. minimum safety bench constraint. block size constraint and block, bench precedence constraints are considered in forming the programming model. This model has more practical objective function and reasonable constraints compared with the existing model for this kind of problems. 展开更多
关键词 quadratic programming open pit mining blast scheduling mine production scheduling mathematical programming model
下载PDF
MIXED ENERGY METHOD FOR SOLUTION OF QUADRATIC PROGRAMMING PROBLEMS AND ELASTIC-PLASTIC ANALYSIS OF TRUSS STRUCTURES 被引量:1
7
作者 Zhong Wanxie Zhang Hongwu 《Acta Mechanica Solida Sinica》 SCIE EI 2002年第1期1-8,共8页
A new algorithm for the solution of quadratic programming problemsis put forward in terms of the mixed energy theory and is furtherused for the incremental solution of elastic-plastic trussstructures. The method propo... A new algorithm for the solution of quadratic programming problemsis put forward in terms of the mixed energy theory and is furtherused for the incremental solution of elastic-plastic trussstructures. The method proposed is different from the traditionalone, for which the unknown variables are selected just in one classsuch as displacements or stresses. The present method selects thevariables in the mixed form with both displacement and stress. As themethod is established in the hybrid space, the information found inthe previous incremental step can be used for the solution of thepresent step, making the algorithm highly effi- cient in thenumerical solution process of quadratic programming problems. Theresults obtained in the exm- ples of the elastic-plastic solution ofthe truss structures verify what has been predicted in thetheoretical anal- ysis. 展开更多
关键词 elastic-plastic analysis mixed energy method quadratic programming problem
下载PDF
A quadratic programming method for optimal degree reduction of Bézier curves with G^1-continuity
8
作者 LU Li-zheng WANG Guo-zhao 《Journal of Zhejiang University-Science A(Applied Physics & Engineering)》 SCIE EI CAS CSCD 2007年第10期1657-1662,共6页
This paper presents a quadratic programming method for optimal multi-degree reduction of B6zier curves with G^1-continuity. The L2 and I2 measures of distances between the two curves are used as the objective function... This paper presents a quadratic programming method for optimal multi-degree reduction of B6zier curves with G^1-continuity. The L2 and I2 measures of distances between the two curves are used as the objective functions. The two additional parameters, available from the coincidence of the oriented tangents, are constrained to be positive so as to satisfy the solvability condition. Finally, degree reduction is changed to solve a quadratic problem of two parameters with linear constraints. Applications of degree reduction of Bezier curves with their parameterizations close to arc-length parameterizations are also discussed. 展开更多
关键词 Degree reduction Bezier curves Optimal approximation G^1-continuity quadratic programming
下载PDF
Quadratic Programming-based Approach for Autonomous Vehicle Path Planning in Space
9
作者 CHEN Yang HAN Jianda WU Huaiyu 《Chinese Journal of Mechanical Engineering》 SCIE EI CAS CSCD 2012年第4期665-673,共9页
Path planning for space vehicles is still a challenging problem although considerable progress has been made over the past decades.The major difficulties are that most of existing methods only adapt to static environm... Path planning for space vehicles is still a challenging problem although considerable progress has been made over the past decades.The major difficulties are that most of existing methods only adapt to static environment instead of dynamic one,and also can not solve the inherent constraints arising from the robot body and the exterior environment.To address these difficulties,this research aims to provide a feasible trajectory based on quadratic programming(QP) for path planning in three-dimensional space where an autonomous vehicle is requested to pursue a target while avoiding static or dynamic obstacles.First,the objective function is derived from the pursuit task which is defined in terms of the relative distance to the target,as well as the angle between the velocity and the position in the relative velocity coordinates(RVCs).The optimization is in quadratic polynomial form according to QP formulation.Then,the avoidance task is modeled with linear constraints in RVCs.Some other constraints,such as kinematics,dynamics,and sensor range,are included.Last,simulations with typical multiple obstacles are carried out,including in static and dynamic environments and one of human-in-the-loop.The results indicate that the optimal trajectories of the autonomous robot in three-dimensional space satisfy the required performances.Therefore,the QP model proposed in this paper not only adapts to dynamic environment with uncertainty,but also can satisfy all kinds of constraints,and it provides an efficient approach to solve the problems of path planning in three-dimensional space. 展开更多
关键词 path planning in three-dimensional space obstacle avoidance target pursuit relative velocity coordinates quadratic programming
下载PDF
Successive quadratic programming multiuser detector
10
作者 Mu Xuewen Zhang Yaling Liu Sanyang 《Journal of Systems Engineering and Electronics》 SCIE EI CSCD 2007年第1期8-13,共6页
Based on the semidefinite programming relaxation of the CDMA maximum likelihood multiuser detection problem, a detection strategy by the successive quadratic programming algorithm is presented. Coupled with the random... Based on the semidefinite programming relaxation of the CDMA maximum likelihood multiuser detection problem, a detection strategy by the successive quadratic programming algorithm is presented. Coupled with the randomized cut generation scheme, the suboptimal solution of the multiuser detection problem in obtained. Compared to the interior point methods previously reported based on semidefmite programming, simulations demonstrate that the successive quadratic programming algorithm often yields the similar BER performances of the multiuser detection problem. But the average CPU time of this approach is significantly reduced. 展开更多
关键词 Code division multiple access Multiuser detection Semidefinite programming Successive quadratic programming.
下载PDF
SEQUENTIAL QUADRATIC PROGRAMMING METHODS FOR OPTIMAL CONTROL PROBLEMS WITH STATE CONSTRAINTS
11
作者 徐成贤 Jong de J. L. 《Applied Mathematics(A Journal of Chinese Universities)》 SCIE CSCD 1993年第2期163-174,共12页
A kind of direct methods is presented for the solution of optimal control problems with state constraints. These methods are sequential quadratic programming methods. At every iteration a quadratic programming which i... A kind of direct methods is presented for the solution of optimal control problems with state constraints. These methods are sequential quadratic programming methods. At every iteration a quadratic programming which is obtained by quadratic approximation to Lagrangian function and linear approximations to constraints is solved to get a search direction for a merit function. The merit function is formulated by augmenting the Lagrangian function with a penalty term. A line search is carried out along the search direction to determine a step length such that the merit function is decreased. The methods presented in this paper include continuous sequential quadratic programming methods and discreate sequential quadratic programming methods. 展开更多
关键词 Optimal Control Problems with State Constraints Sequential quadratic programming Lagrangian Function. Merit Function Line Search.
下载PDF
Automatic differentiation for reduced sequential quadratic programming
12
作者 Liao Liangcai Li Jin Tan Yuejin 《Journal of Systems Engineering and Electronics》 SCIE EI CSCD 2007年第1期57-62,共6页
In order to slove the large-scale nonlinear programming (NLP) problems efficiently, an efficient optimization algorithm based on reduced sequential quadratic programming (rSQP) and automatic differentiation (AD)... In order to slove the large-scale nonlinear programming (NLP) problems efficiently, an efficient optimization algorithm based on reduced sequential quadratic programming (rSQP) and automatic differentiation (AD) is presented in this paper. With the characteristics of sparseness, relatively low degrees of freedom and equality constraints utilized, the nonlinear programming problem is solved by improved rSQP solver. In the solving process, AD technology is used to obtain accurate gradient information. The numerical results show that the combined algorithm, which is suitable for large-scale process optimization problems, can calculate more efficiently than rSQP itself. 展开更多
关键词 Automatic differentiation Reduced sequential quadratic programming Optimization algorithm
下载PDF
Filter-sequence of quadratic programming method with nonlinear complementarity problem function
13
作者 金中 濮定国 +1 位作者 张宇 蔡力 《Journal of Shanghai University(English Edition)》 CAS 2008年第2期97-101,共5页
A mechanism for proving global convergence in filter-SQP (sequence of quadratic programming) method with the nonlinear complementarity problem (NCP) function is described for constrained nonlinear optimization pro... A mechanism for proving global convergence in filter-SQP (sequence of quadratic programming) method with the nonlinear complementarity problem (NCP) function is described for constrained nonlinear optimization problem.We introduce an NCP function into the filter and construct a new SQP-filter algorithm.Such methods are characterized by their use of the dominance concept of multi-objective optimization,instead of a penalty parameter whose adjustment can be problematic.We prove that the algorithm has global convergence and superlinear convergence rates under some mild conditions. 展开更多
关键词 nonlinear complementarity problem (NCP) function FILTER sequence of quadratic programming (SQP) globalconvergence.
下载PDF
A SUCCESSIVE QUADRATIC PROGRAMMING ALGORITHM FOR SDP RELAXATION OF MAX-BISECTION
14
作者 Mu Xuewen Zhang Yaling Liu Sanyang 《Applied Mathematics(A Journal of Chinese Universities)》 SCIE CSCD 2007年第4期434-440,共7页
A successive quadratic programming algorithm for solving SDP relaxation of Max- Bisection is provided and its convergence result is given. The step-size in the algorithm is obtained by solving n easy quadratic equatio... A successive quadratic programming algorithm for solving SDP relaxation of Max- Bisection is provided and its convergence result is given. The step-size in the algorithm is obtained by solving n easy quadratic equations without using the linear search technique. The numerical experiments show that this algorithm is rather faster than the interior-point method. 展开更多
关键词 semidefinite programming Max-Bisection successive quadratic programming.
下载PDF
Optimization Model on Quadratic Programming Problem with Fuzzy
15
作者 Sugiyarto Surono Yosza Dasril Mohd Ismail 《Journal of Mathematics and System Science》 2012年第7期464-468,共5页
In this paper, the authors propose a computational procedure by using fuzzy approach to fred the optimal solution of quadratic programming problems. The authors divide the calculation of the optimal solution into two ... In this paper, the authors propose a computational procedure by using fuzzy approach to fred the optimal solution of quadratic programming problems. The authors divide the calculation of the optimal solution into two stages. In the first stage the authors determine the unconstrained minimization and check its feasibility. The second stage, the authors explore the feasible region from initial point to another point until the authors get the optimal point by using Lagrange multiplier. A numerical example is included to support as illustration of the paper. 展开更多
关键词 Fuzzy optimal solution triangular fuzzy number feasible set quadratic programming positive definite.
下载PDF
Stability analysis of proportional delayed projection neural network for quadratic programming problem 被引量:1
16
作者 Xiehui Song Liqun Zhou +2 位作者 Yu Wang Shiru Zhang Yuji Zhang 《International Journal of Biomathematics》 SCIE 2023年第1期235-259,共25页
At present,projection neural network(PNN)with bounded time delay has been widely used for solving convex quadratic programming problem(QPP).However,there is little research concerning PNN with unbounded time delay.In ... At present,projection neural network(PNN)with bounded time delay has been widely used for solving convex quadratic programming problem(QPP).However,there is little research concerning PNN with unbounded time delay.In this paper,we propose the proportional delayed PNN to solve QPP with equality constraints.By utilizing homeo morphism mapping principle,we prove the proportional delayed PNN exists with unique equilibrium point which is the optimal solution of QPP.Simultaneously,delay-dependent criteria about global exponential stability(GES)and global polynomial stability(GPS)are also acquired by applying the method of variation of constants and inequality techniques.On the other hand,when proportional delay factor q is equal to 1,the proportional delayed PNN becomes the one without time delay which still can be utilized for solving QPP.But in most situations,q is not equal to 1,and time delay is unpredictable and may be unbounded in the actual neural network,which causes instability of system.Therefore,it is necessary to consider proportional delayed PNN.A numerical example demonstrates that,compared with the proportional delayed Lagrange neural network,the proportional delayed PNN is faster in terms of convergence rate.The possible reason is that appropriate parameters make the model converge to the equilibrium point along the direction of gradient descent. 展开更多
关键词 quadratic programming problem proportional delay neural networks(NNs) exponential stability polynomial stability
原文传递
A Modified Lagrange Method for Solving Convex Quadratic Optimization Problems
17
作者 Twum B. Stephen Avoka John Christian J. Etwire 《Open Journal of Optimization》 2024年第1期1-20,共20页
In this paper, a modified version of the Classical Lagrange Multiplier method is developed for convex quadratic optimization problems. The method, which is evolved from the first order derivative test for optimality o... In this paper, a modified version of the Classical Lagrange Multiplier method is developed for convex quadratic optimization problems. The method, which is evolved from the first order derivative test for optimality of the Lagrangian function with respect to the primary variables of the problem, decomposes the solution process into two independent ones, in which the primary variables are solved for independently, and then the secondary variables, which are the Lagrange multipliers, are solved for, afterward. This is an innovation that leads to solving independently two simpler systems of equations involving the primary variables only, on one hand, and the secondary ones on the other. Solutions obtained for small sized problems (as preliminary test of the method) demonstrate that the new method is generally effective in producing the required solutions. 展开更多
关键词 quadratic programming Lagrangian Function Lagrange Multipliers Optimality Conditions Subsidiary Equations Modified Lagrange Method
下载PDF
Sequential quadratic programming particle swarm optimization for wind power system operations considering emissions 被引量:5
18
作者 Yang ZHANG Fang YAO +2 位作者 Herbert Ho-Ching IU Tyrone FERNANDO Kit Po WONG 《Journal of Modern Power Systems and Clean Energy》 SCIE EI 2013年第3期231-240,共10页
In this paper,a computation framework for addressing combined economic and emission dispatch(CEED)problem with valve-point effects as well as stochastic wind power considering unit commitment(UC)using a hybrid approac... In this paper,a computation framework for addressing combined economic and emission dispatch(CEED)problem with valve-point effects as well as stochastic wind power considering unit commitment(UC)using a hybrid approach connecting sequential quadratic programming(SQP)and particle swarm optimization(PSO)is proposed.The CEED problem aims to minimize the scheduling cost and greenhouse gases(GHGs)emission cost.Here the GHGs include carbon dioxide(CO_(2)),nitrogen dioxide(NO_(2)),and sulphur oxides(SO_(x)).A dispatch model including both thermal generators and wind farms is developed.The probability of stochastic wind power based on the Weibull distribution is included in the CEED model.The model is tested on a standard system involving six thermal units and two wind farms.A set of numerical case studies are reported.The performance of the hybrid computational method is validated by comparing with other solvers on the test system. 展开更多
关键词 Combined economic and emission dispatch Unit commitment Particle swarm optimization Sequential quadratic programming Weibull distribution Wind power
原文传递
Smooth free-cycle dynamic soaring in unspecified shear wind via quadratic programming 被引量:2
19
作者 Haichao HONG Benedikt GRüTER +1 位作者 Patrick PIPREK Florian HOLZAPFEL 《Chinese Journal of Aeronautics》 SCIE EI CAS CSCD 2022年第7期19-29,共11页
Harvesting wind energy is promising for extending long-endurance flights,which can be greatly facilitated by a flight technique called dynamic soaring.The presented study is concerned with generating model-based traje... Harvesting wind energy is promising for extending long-endurance flights,which can be greatly facilitated by a flight technique called dynamic soaring.The presented study is concerned with generating model-based trajectories with smooth control histories for dynamic soaring maneuvers exploiting wind gradients.The desired smoothness is achieved by introducing a trigonometric series parameterization for the controls,which are formulated with respect to the normalized time.Specifically,the periodicity of the trigonometric functions is leveraged to facilitate the connection of cycles and streamline the problem formulation.Without relying on a specified wind profile,a freefinal-time quadratic programming-based control strategy is developed for the online correction of the flight trajectory,which requires only the instant wind information.Offline and online numerical studies show the trade-off to achieve the smoothness and demonstrate the effectiveness of the proposed method in a varying wind field. 展开更多
关键词 Dynamic soaring Optimal control quadratic programming Trajectory generation Trigonometric series
原文传递
Global Optimization of a Class of Nonconvex Quadratically Constrained Quadratic Programming Problems 被引量:1
20
作者 Yong XIA 《Acta Mathematica Sinica,English Series》 SCIE CSCD 2011年第9期1803-1812,共10页
In this paper we study a Class of nonconvex quadratically constrained quadratic programming problems generalized from relaxations of quadratic assignment problems. We show that each problem is polynomially solved. Str... In this paper we study a Class of nonconvex quadratically constrained quadratic programming problems generalized from relaxations of quadratic assignment problems. We show that each problem is polynomially solved. Strong duality holds if a redundant constraint is introduced. As an application, a new lower bound is proposed for the quadratic assignment problem. 展开更多
关键词 Nonconvex programming quadratically constrained quadratic programming quadratic assignment problem polynomial solvability strong duality
原文传递
上一页 1 2 7 下一页 到第
使用帮助 返回顶部