Recursive quadratic programming for constrained nonlinear optimization of session throughput in multiple‐flow network topologies
نویسندگان
چکیده
منابع مشابه
On the Solution of Equality Constrained Quadratic Programming Problems Arising in Optimization Equality Constrained Quadratic Programming Problems Arising in Optimization
We consider the application of the conjugate gradient method to the solution of large equality constrained quadratic programs arising in nonlinear optimization. Our approach is based on a reduced linear system and generates iterates in the null space of the constraints. Instead of computing a basis for this null space, we choose to work directly with the matrix of constraint gradients, computin...
متن کاملSequential equality-constrained optimization for nonlinear programming
A new method is proposed for solving optimization problems with equality constraints and bounds on the variables. In the spirit of Sequential Quadratic Programming and Sequential Linearly-Constrained Programming, the new method approximately solves, at each iteration, an equality-constrained optimization problem. The bound constraints are handled in outer iterations by means of an Augmented Lag...
متن کاملInversion of Gravity Data by Constrained Nonlinear Optimization based on nonlinear Programming Techniques for Mapping Bedrock Topography
A constrained nonlinear optimization method based on nonlinear programming techniques has been applied to map geometry of bedrock of sedimentary basins by inversion of gravity anomaly data. In the inversion, the applying model is a 2-D model that is composed of a set of juxtaposed prisms whose lower depths have been considered as unknown model parameters. The applied inversion method is a nonli...
متن کاملSequential Quadratic Programming forLarge - Scale Nonlinear Optimization ?
The sequential quadratic programming (SQP) algorithm has been one of the most successful general methods for solving nonlinear constrained optimization problems. We provide an introduction to the general method and show its relationship to recent developments in interior-point approaches. We emphasize large-scale aspects.
متن کاملA Sequential Quadratic Programming Algorithm for Nonconvex, Nonsmooth Constrained Optimization
We consider optimization problems with objective and constraint functions that may be nonconvex and nonsmooth. Problems of this type arise in important applications, many having solutions at points of nondifferentiability of the problem functions. We present a line search algorithm for situations when the objective and constraint functions are locally Lipschitz and continuously differentiable o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Engineering Reports
سال: 2020
ISSN: 2577-8196,2577-8196
DOI: 10.1002/eng2.12169