A Sequential Quadratic Programming Algorithm for Solving Large, Sparse Nonlinear Programs
A Sequential Quadratic Programming Algorithm for Solving Large, Sparse Nonlinear Programs

Author: Ronald Harlan Nickel

Publisher:

Published: 1984

Total Pages: 180

ISBN-13:

DOWNLOAD EBOOK

This document describes the structure and theory for a sequential quadratic programming algorithm for solving large, sparse nonlinear optimization problems. Also provided are the details of a computer implementation of the algorithm, along with test results. The algorithm is based on Han's sequential quadratic programming method. It maintains a sparse approximation to the Cholesky factor of the Hessian of the Lagrangian and stores all gradients in a sparse format. The solution to the quadratic program generated at each step is obtained by solving the dual quadratic program using a projected conjugate gradient algorithm. Sine only active constraints are considered in forming the dual, the dual problem will normally be much smaller than the primal quadratic program and, hence, much easier to solve. An updating procedure is employed that does not destroy sparsity. Several test problems, ranging in size from 5 to 60 variables were solved with the algorithm. These results indicate that the algorithm has the potential to solve large, sparse nonlinear programs. The algorithm is especially attractive for solving problems having nonlinear constraints. (Author).

Nonlinear Programming and Variational Inequality Problems
Nonlinear Programming and Variational Inequality Problems

Author: Michael Patriksson

Publisher: Springer Science & Business Media

Published: 2013-06-29

Total Pages: 343

ISBN-13: 147572991X

DOWNLOAD EBOOK

Since I started working in the area of nonlinear programming and, later on, variational inequality problems, I have frequently been surprised to find that many algorithms, however scattered in numerous journals, monographs and books, and described rather differently, are closely related to each other. This book is meant to help the reader understand and relate algorithms to each other in some intuitive fashion, and represents, in this respect, a consolidation of the field. The framework of algorithms presented in this book is called Cost Approxi mation. (The preface of the Ph.D. thesis [Pat93d] explains the background to the work that lead to the thesis, and ultimately to this book.) It describes, for a given formulation of a variational inequality or nonlinear programming problem, an algorithm by means of approximating mappings and problems, a principle for the update of the iteration points, and a merit function which guides and monitors the convergence of the algorithm. One purpose of this book is to offer this framework as an intuitively appeal ing tool for describing an algorithm. One of the advantages of the framework, or any reasonable framework for that matter, is that two algorithms may be easily related and compared through its use. This framework is particular in that it covers a vast number of methods, while still being fairly detailed; the level of abstraction is in fact the same as that of the original problem statement.

A Direct Method for Parabolic PDE Constrained Optimization Problems
A Direct Method for Parabolic PDE Constrained Optimization Problems

Author: Andreas Potschka

Publisher: Springer Science & Business Media

Published: 2013-11-29

Total Pages: 220

ISBN-13: 3658044764

DOWNLOAD EBOOK

Andreas Potschka discusses a direct multiple shooting method for dynamic optimization problems constrained by nonlinear, possibly time-periodic, parabolic partial differential equations. In contrast to indirect methods, this approach automatically computes adjoint derivatives without requiring the user to formulate adjoint equations, which can be time-consuming and error-prone. The author describes and analyzes in detail a globalized inexact Sequential Quadratic Programming method that exploits the mathematical structures of this approach and problem class for fast numerical performance. The book features applications, including results for a real-world chemical engineering separation problem.

Quadratic Programming and Affine Variational Inequalities
Quadratic Programming and Affine Variational Inequalities

Author: Gue Myung Lee

Publisher: Springer Science & Business Media

Published: 2005-02-23

Total Pages: 370

ISBN-13: 9780387242774

DOWNLOAD EBOOK

This book develops a unified theory on qualitative aspects of nonconvex quadratic programming and affine variational inequalities. One special feature of the book is that when a certain property of a characteristic map or function is investigated, the authors always try first to establish necessary conditions for it to hold, then they go on to study whether the obtained necessary conditions are also sufficient ones. This helps to clarify the structures of the two classes of problems under consideration. The qualitative results can be used for dealing with algorithms and applications related to quadratic programming problems and affine variational inequalities.

Numerical Analysis and Optimization
Numerical Analysis and Optimization

Author: Mehiddin Al-Baali

Publisher: Springer Nature

Published: 2021-12-01

Total Pages: 307

ISBN-13: 3030720403

DOWNLOAD EBOOK

This book gathers selected, peer-reviewed contributions presented at the Fifth International Conference on Numerical Analysis and Optimization (NAO-V), which was held at Sultan Qaboos University, Oman, on January 6-9, 2020. Each chapter reports on developments in key fields, such as numerical analysis, numerical optimization, numerical linear algebra, numerical differential equations, optimal control, approximation theory, applied mathematics, derivative-free optimization methods, programming models, and challenging applications that frequently arise in statistics, econometrics, finance, physics, medicine, biology, engineering and industry. Many real-world, complex problems can be formulated as optimization tasks, and can be characterized further as large scale, unconstrained, constrained, non-convex, nondifferentiable or discontinuous, and therefore require adequate computational methods, algorithms and software tools. These same tools are often employed by researchers working in current IT hot topics, such as big data, optimization and other complex numerical algorithms in the cloud, devising special techniques for supercomputing systems. This interdisciplinary view permeates the work included in this volume. The NAO conference series is held every three years at Sultan Qaboos University, with the aim of bringing together a group of international experts and presenting novel and advanced applications to facilitate interdisciplinary studies among pure scientific and applied knowledge. It is a venue where prominent scientists gather to share innovative ideas and know-how relating to new scientific methodologies, to promote scientific exchange, to discuss possible future cooperations, and to promote the mobility of local and young researchers.

Nonlinear Programming
Nonlinear Programming

Author: Anthony V. Fiacco

Publisher: SIAM

Published: 1990-01-01

Total Pages: 226

ISBN-13: 9781611971316

DOWNLOAD EBOOK

Recent interest in interior point methods generated by Karmarkar's Projective Scaling Algorithm has created a new demand for this book because the methods that have followed from Karmarkar's bear a close resemblance to those described. There is no other source for the theoretical background of the logarithmic barrier function and other classical penalty functions. Analyzes in detail the "central" or "dual" trajectory used by modern path following and primal/dual methods for convex and general linear programming. As researchers begin to extend these methods to convex and general nonlinear programming problems, this book will become indispensable to them.

Large-scale Sequential Quadratic Programming Algorithms
Large-scale Sequential Quadratic Programming Algorithms

Author:

Publisher:

Published: 1992

Total Pages: 91

ISBN-13:

DOWNLOAD EBOOK

The problem addressed is the general nonlinear programming problem: finding a local minimizer for a nonlinear function subject to a mixture of nonlinear equality and inequality constraints. The methods studied are in the class of sequential quadratic programming (SQP) algorithms, which have previously proved successful for problems of moderate size. Our goal is to devise an SQP algorithm that is applicable to large-scale optimization problems, using sparse data structures and storing less curvature information but maintaining the property of superlinear convergence. The main features are: 1. The use of a quasi-Newton approximation to the reduced Hessian of the Lagrangian function. Only an estimate of the reduced Hessian matrix is required by our algorithm. The impact of not having available the full Hessian approximation is studied and alternative estimates are constructed. 2. The use of a transformation matrix Q. This allows the QP gradient to be computed easily when only the reduced Hessian approximation is maintained. 3. The use of a reduced-gradient form of the basis for the null space of the working set. This choice of basis is more practical than an orthogonal null-space basis for large-scale problems. The continuity condition for this choice is proven. 4. The use of incomplete solutions of quadratic programming subproblems. Certain iterates generated by an active-set method for the QP subproblem are used in place of the QP minimizer to define the search direction for the nonlinear problem. An implementation of the new algorithm has been obtained by modifying the code MINOS. Results and comparisons with MINOS and NPSOL are given for the new algorithm on a set of 92 test problems.