共查询到20条相似文献,搜索用时 31 毫秒
1.
The present paper is devoted to the application of the space transformation techniques for solving linear programming problems. By using a surjective mapping the original constrained optimization problem is transformed to a problem in a new space with only equality constraints. For the numerical solution of the latter problem the stable version of the gradient-projection and Newton's methods are used. After an inverse transformation to the original space a family of numerical methods for solving optimization problems with equality and inequality constraints is obtained. The proposed algorithms are based on the numerical integration of the systems of ordinary differential equations. These algorithms do not require feasibility of the starting and current points, but they preserve feasibility. As a result of a space transformation the vector fields of differential equations are changed and additional terms are introduced which serve as a barrier preventing the trajectories from leaving the feasible set. A proof of a convergence is given.Dedicated to Professor George B. Dantzig on the occasion of his eightieth birthday.Research was supported by the grant N93-012-450 from Russian Scientific Fund. 相似文献
2.
3.
将0-1离散规划通过一个非线性等式约束表示为[0,1]区间上等价的连续变量非线性规划列式.对非线性等式约束的问题进行了两种方法的处理.第一种方法使用乘子法,第二种方法将非线性的等式约束近似为一个非线性的不等式约束,均利用遗传算法程序GENOCOP进行了求解.对多个算例进行了计算,结果表明了该方法的可行性和有效性. 相似文献
4.
5.
Several numerical methods for solving the nonlinear two-point boundary value problem associated with an optimum spacecraft trajectory are considered. A comparative evaluation of the methods is made to determine the relative merits of each method. Particular attention is given to such characteristics as the simplicity of formulation and implementation, the convergence sensitivity, the computing time required, and the computer storage requirements. The methods considered are the perturbation method, the quasilinearization method, and the gradient method. The numerical comparison is made by considering a two-dimensional, low-thrust, minimum-time, Earth-Mars trajectory.The authors are greatly indebted to Mr. Robert D. Witty, Lockheed Electronics Company, for providing the excellent programming support. 相似文献
6.
Hao-Chun Lu 《Journal of Global Optimization》2017,68(1):95-123
Free-sign pure discrete signomial (FPDS) terms are vital to and are frequently observed in many nonlinear programming problems, such as geometric programming, generalized geometric programming, and mixed-integer non-linear programming problems. In this study, all variables in the FPDS term are discrete variables. Any improvement to techniques for linearizing FPDS term contributes significantly to the solving of nonlinear programming problems; therefore, relative techniques have continually been developed. This study develops an improved exact method to linearize a FPDS term into a set of linear programs with minimal logarithmic numbers of zero-one variables and constraints. This method is tighter than current methods. Various numerical experiments demonstrate that the proposed method is significantly more efficient than current methods, especially when the problem scale is large. 相似文献
7.
Aubrey B. Poore 《Annals of Operations Research》1990,27(1):343-369
Bifurcation and continuation techniques are introduced as a class of methods for investigating the parametric nonlinear programming problem. Motivated by the Fritz John first-order necessary conditions, the parametric programming problem is first reformulated as a closed system of nonlinear equations which contains all Karush-Kuhn-Tucker and Fritz John points, both feasible and infeasible solutions, and relative minima, maxima, and saddle points. Since changes in the structure of the solution set and critical point type can occur only at singularities, necessary and sufficient conditions for the existence of a singularity are developed in terms of the loss of a complementarity condition, the linear dependence constraint qualification, and the singularity of the Hessian of the Lagrangian on a tangent space. After a brief introduction to elementary bifurcation theory, some simple singularities in this parametric problem are analyzed for both branching and persistence of local minima. Finally, a brief introduction to numerical continuation and bifurcation procedures is given to indicate how these facts can be used in a numerical investigation of the problem.This research was supported by the Air force Office of Scientific Research through grant number AFOSR-88-0059. 相似文献
8.
The objective of multihazard structural engineering is to develop methodologies for achieving designs that are safe and cost-effective
under multiple hazards. Optimization is a natural tool for achieving such designs. In general, its aim is to determine a vector
of design variables subjected to a given set of constraints, such that an objective function of those variables is minimized.
In the particular case of structural design, the design variables may be member sizes; the constraints pertain to structural
strength and serviceability (e.g., keeping the load-induced stresses and deflections below specified thresholds); and the
objective function is the structure cost or weight. In a multihazard context, the design variables are subjected to the constraints
imposed by all the hazards to which the structure is exposed. In this paper, we formulate the multihazard structural design
problem in nonlinear programming terms and present a simple illustrative example involving four design variables and two hazards:
earthquake and strong winds. Results of our numerical experiments show that interior-point methods are significantly more
efficient than classical optimization methods in solving the nonlinear programming problem associated with our illustrative
example. 相似文献
9.
Ming-Hua LinJung-Fa Tsai 《European Journal of Operational Research》2012,216(1):17-25
Many global optimization approaches for solving signomial geometric programming problems are based on transformation techniques and piecewise linear approximations of the inverse transformations. Since using numerous break points in the linearization process leads to a significant increase in the computational burden for solving the reformulated problem, this study integrates the range reduction techniques in a global optimization algorithm for signomial geometric programming to improve computational efficiency. In the proposed algorithm, the non-convex geometric programming problem is first converted into a convex mixed-integer nonlinear programming problem by convexification and piecewise linearization techniques. Then, an optimization-based approach is used to reduce the range of each variable. Tightening variable bounds iteratively allows the proposed method to reach an approximate solution within an acceptable error by using fewer break points in the linearization process, therefore decreasing the required CPU time. Several numerical experiments are presented to demonstrate the advantages of the proposed method in terms of both computational efficiency and solution quality. 相似文献
10.
In this paper, we present a novel sequential convex bilevel programming algorithm for the numerical solution of structured nonlinear min–max problems which arise in the context of semi-infinite programming. Here, our main motivation are nonlinear inequality constrained robust optimization problems. In the first part of the paper, we propose a conservative approximation strategy for such nonlinear and non-convex robust optimization problems: under the assumption that an upper bound for the curvature of the inequality constraints with respect to the uncertainty is given, we show how to formulate a lower-level concave min–max problem which approximates the robust counterpart in a conservative way. This approximation turns out to be exact in some relevant special cases and can be proven to be less conservative than existing approximation techniques that are based on linearization with respect to the uncertainties. In the second part of the paper, we review existing theory on optimality conditions for nonlinear lower-level concave min–max problems which arise in the context of semi-infinite programming. Regarding the optimality conditions for the concave lower level maximization problems as a constraint of the upper level minimization problem, we end up with a structured mathematical program with complementarity constraints (MPCC). The special hierarchical structure of this MPCC can be exploited in a novel sequential convex bilevel programming algorithm. We discuss the surprisingly strong global and locally quadratic convergence properties of this method, which can in this form neither be obtained with existing SQP methods nor with interior point relaxation techniques for general MPCCs. Finally, we discuss the application fields and implementation details of the new method and demonstrate the performance with a numerical example. 相似文献
11.
Akbar H. Borzabadi 《Numerical Functional Analysis & Optimization》2013,34(11):1083-1098
In this article, a numerical scheme on the basis of the measure theoretical approach for extracting approximate solutions of optimal control problems governed by nonlinear Fredholm integral equations is presented. The problem is converted to a linear programming in which its solution leads to construction of approximate solutions of the original problem. Finally, some numerical examples are given to demonstrate the efficiency of the approach. 相似文献
12.
Direct Shooting Method for the Numerical Solution of Higher-Index DAE Optimal Control Problems 总被引:3,自引:0,他引:3
A method for the numerical solution of state-constrained optimal control problems subject to higher-index differential-algebraic equation (DAE) systems is introduced. For a broad and important class of DAE systems (semiexplicit systems with algebraic variables of different index), a direct multiple shooting method is developed. The multiple shooting method is based on the discretization of the optimal control problem and its transformation into a finite-dimensional nonlinear programming problem (NLP). Special attention is turned to the mandatory calculation of consistent initial values at the multiple shooting nodes within the iterative solution process of (NLP). Two different methods are proposed. The projection method guarantees consistency within each iteration, whereas the relaxation method achieves consistency only at an optimal solution. An illustrative example completes this article. 相似文献
13.
14.
15.
关于TLS问题的可解性 总被引:4,自引:1,他引:3
§1.引言如无特殊说明,本文沿用[4]中的记号和术语.Golub和Van Loan于1980年引入了下述完全最小二乘问题(简称TLS问题): 相似文献
16.
B. T. Poljak 《Mathematical Programming》1978,14(1):87-97
The problem of minimizing a nonlinear function with nonlinear constraints when the values of the objective, the constraints and their gradients have errors, is studied. This noise may be due to the stochastic nature of the problem or to numerical error.Various previously proposed methods are reviewed. Generally, the minimization algorithms involve methods of subgradient optimization, with the constraints introduced through penalty, Lagrange, or extended Lagrange functions. Probabilistic convergence theorems are obtained. Finally, an algorithm to solve the general convex (nondifferentiable) programming problem with noise is proposed.Originally written for presentation at the 1976 Budapest Symposium on Mathematical Programming. 相似文献
17.
《Applied Mathematical Modelling》2014,38(7-8):2000-2014
Real engineering design problems are generally characterized by the presence of many often conflicting and incommensurable objectives. Naturally, these objectives involve many parameters whose possible values may be assigned by the experts. The aim of this paper is to introduce a hybrid approach combining three optimization techniques, dynamic programming (DP), genetic algorithms and particle swarm optimization (PSO). Our approach integrates the merits of both DP and artificial optimization techniques and it has two characteristic features. Firstly, the proposed algorithm converts fuzzy multiobjective optimization problem to a sequence of a crisp nonlinear programming problems. Secondly, the proposed algorithm uses H-SOA for solving nonlinear programming problem. In which, any complex problem under certain structure can be solved and there is no need for the existence of some properties rather than traditional methods that need some features of the problem such as differentiability and continuity. Finally, with different degree of α we get different α-Pareto optimal solution of the problem. A numerical example is given to illustrate the results developed in this paper. 相似文献
18.
The nonlinear complementarity problem can be reformulated as a nonlinear programming. For solving nonlinear programming, sequential quadratic programming (SQP) type method is very effective. Moreover, filter method, for its good numerical results, are extensively studied to handle nonlinear programming problems recently. In this paper, a modified quadratic subproblem is proposed. Based on it, we employ filter technique to tackle nonlinear complementarity problem. This method has no demand on initial point. The restoration phase, which is always used in traditional filter method, is not needed. Global convergence results of the proposed algorithm are established under suitable conditions. Some numerical results are reported in this paper. 相似文献
19.
Christakis Charalambous 《Mathematical Programming》1977,12(1):195-225
Over the past few years a number of researchers in mathematical programming became very interested in the method of the Augmented Lagrangian to solve the nonlinear programming problem. The main reason being that the Augmented Lagrangian approach overcomes the ill-conditioning problem and the slow convergence of the penalty methods. The purpose of this paper is to present a new method of solving the nonlinear programming problem, which has similar characteristics to the Augmented Lagrangian method. The original nonlinear programming problem is transformed into the minimization of a leastpth objective function which under certain conditions has the same optimum as the original problem. Convergence and rate of convergence of the new method is also proved. Furthermore numerical results are presented which illustrate the usefulness of the new approach to nonlinear programming.This work was supported by the National Research Council of Canada and by the Department of Combinatorics and Optimization of the University of Waterloo. 相似文献
20.
《Optimization》2012,61(4):517-530
In the present paper the radius of convergence of a class of locally convergent nonlinear programming algorithms (containing Robinson's and Wilson's methods) applied to a parametric nonlinear programming problem is estimated. A consequence is the numerical feasibility of globalizations of Robinson's and Wilson's methods by means of continuation techniques. 相似文献