A Primal-dual Active-set Method for Convex Quadratic Programming
Author: Ekaterina A. Kostina
Publisher:
Published: 2003
Total Pages: 20
ISBN-13:
DOWNLOAD EBOOKRead and Download eBook Full
Author: Ekaterina A. Kostina
Publisher:
Published: 2003
Total Pages: 20
ISBN-13:
DOWNLOAD EBOOKAuthor:
Publisher: Stanford University
Published:
Total Pages: 128
ISBN-13:
DOWNLOAD EBOOKAuthor: Zheng Han
Publisher:
Published: 2015
Total Pages: 159
ISBN-13: 9781339069166
DOWNLOAD EBOOKAnother PDAS variant is proposed for solving certain convex QPs that commonly arise when discretizing optimal control problems. The proposed framework allows inexactness in the subproblem solutions, which can significantly reduce computational cost in large-scale settings. By controlling the level inexactness either by exploiting knowledge of an upper bound of a matrix inverse or by dynamic estimation of such a value, the method achieves convergence guarantees and is shown to outperform a method that employs exact solutions computed by direct factorization techniques.
Author: Elizabeth Lai Sum Wong
Publisher:
Published: 2011
Total Pages: 125
ISBN-13: 9781124691152
DOWNLOAD EBOOKComputational methods are considered for finding a point satisfying the second-order necessary conditions for a general (possibly nonconvex) quadratic program (QP). A framework for the formulation and analysis of feasible-point active-set methods is proposed for a generic QP. This framework is defined by reformulating and extending an inertia-controlling method for general QP that was first proposed by Fletcher and subsequently modified by Gould. This reformulation defines a class of methods in which a primal-dual search pair is the solution of a "KKT system'' of equations associated with an equality-constrained QP subproblem defined in terms of a "working set'' of linearly independent constraints. It is shown that, under certain circumstances, the solution of this KKT system may be updated using a simple recurrence relation, thereby giving a significant reduction in the number of systems that need to be solved. The use of inertia control guarantees that the KKT systems remain nonsingular throughout, thereby allowing the utilization of third-party linear algebra software. The algorithm is suitable for indefinite problems, making it an ideal QP solver for stand-alone applications and for use within a sequential quadratic programming method using exact second derivatives. The proposed framework is applied to primal and dual quadratic problems, as well as to single-phase problems that combine the feasibility and optimality phases of the active-set method, producing a range of formats that are suitable for a variety of applications. The algorithm is implemented in the Fortran code icQP. Its performance is evaluated using different symmetric and unsymmetric linear solvers on a set of convex and nonconvex problems. Results are presented that compare the performance of icQP with the convex QP solver SQOPT on a large set of convex problems.
Author: Christopher Mario Maes
Publisher:
Published: 2010
Total Pages:
ISBN-13:
DOWNLOAD EBOOKAn active-set algorithm is developed for solving convex quadratic programs (QPs). The algorithm employs primal regularization within a bound-constrained augmented Lagrangian method. This leads to a sequence of QP subproblems that are feasible and strictly convex, and whose KKT systems are guaranteed to be nonsingular for any active set. A simplified, single-phase algorithm becomes possible for each QP subproblem. There is no need to control the inertia of the KKT system defining each search direction, and a simple step-length procedure may be used without risk of cycling in the presence of degeneracy. Since all KKT systems are nonsingular, they can be factored with a variety of sparse direct linear solvers. Block-LU updates of the KKT factors allow for active-set changes. The principal benefit of primal and dual regularization is that warm starts are possible from any given active set. This is vital inside sequential quadratic programming (SQP) methods for nonlinear optimization, such as the SNOPT solver. The method provides a reliable approach to solving sparse generalized least-squares problems. Ordinary least-squares problems with Tikhonov regularization and bounds can be solved as a single QP subproblem. The algorithm is implemented as the QPBLUR solver (Matlab and Fortran 95 versions) and the Fortran version has been integrated into SNOPT. The performance of QPBLUR is evaluated on a test set of large convex QPs, and on the sequences of QPs arising from SNOPT's SQP method.
Author: Daniel Arnström
Publisher: Linköping University Electronic Press
Published: 2021-03-03
Total Pages: 45
ISBN-13: 9179296920
DOWNLOAD EBOOKIn model predictive control (MPC) an optimization problem has to be solved at each time step, which in real-time applications makes it important to solve these efficiently and to have good upper bounds on worst-case solution time. Often for linear MPC problems, the optimization problem in question is a quadratic program (QP) that depends on parameters such as system states and reference signals. A popular class of methods for solving such QPs is active-set methods, where a sequence of linear systems of equations is solved. The primary contribution of this thesis is a method which determines which sequence of subproblems a popular class of such active-set algorithms need to solve, for every possible QP instance that might arise from a given linear MPC problem (i.e, for every possible state and reference signal). By knowing these sequences, worst-case bounds on how many iterations, floating-point operations and, ultimately, the maximum solution time, these active-set algorithms require to compute a solution can be determined, which is of importance when, e.g, linear MPC is used in safety-critical applications. After establishing this complexity certification method, its applicability is extended by showing how it can be used indirectly to certify the complexity of another, efficient, type of active-set QP algorithm which reformulates the QP as a nonnegative least-squares method. Finally, the proposed complexity certification method is extended further to situations when enhancements to the active-set algorithms are used, namely, when they are terminated early (to save computations) and when outer proximal-point iterations are performed (to improve numerical stability).
Author: Yurii Nesterov
Publisher: SIAM
Published: 1994-01-01
Total Pages: 414
ISBN-13: 9781611970791
DOWNLOAD EBOOKSpecialists working in the areas of optimization, mathematical programming, or control theory will find this book invaluable for studying interior-point methods for linear and quadratic programming, polynomial-time methods for nonlinear convex programming, and efficient computational methods for control problems and variational inequalities. A background in linear algebra and mathematical programming is necessary to understand the book. The detailed proofs and lack of "numerical examples" might suggest that the book is of limited value to the reader interested in the practical aspects of convex optimization, but nothing could be further from the truth. An entire chapter is devoted to potential reduction methods precisely because of their great efficiency in practice.
Author: Stephen J. Wright
Publisher: SIAM
Published: 1997-01-01
Total Pages: 309
ISBN-13: 9781611971453
DOWNLOAD EBOOKIn the past decade, primal-dual algorithms have emerged as the most important and useful algorithms from the interior-point class. This book presents the major primal-dual algorithms for linear programming in straightforward terms. A thorough description of the theoretical properties of these methods is given, as are a discussion of practical and computational aspects and a summary of current software. This is an excellent, timely, and well-written work. The major primal-dual algorithms covered in this book are path-following algorithms (short- and long-step, predictor-corrector), potential-reduction algorithms, and infeasible-interior-point algorithms. A unified treatment of superlinear convergence, finite termination, and detection of infeasible problems is presented. Issues relevant to practical implementation are also discussed, including sparse linear algebra and a complete specification of Mehrotra's predictor-corrector algorithm. Also treated are extensions of primal-dual algorithms to more general problems such as monotone complementarity, semidefinite programming, and general convex programming problems.
Author: Francesco Borrelli
Publisher: Cambridge University Press
Published: 2017-06-22
Total Pages: 447
ISBN-13: 1107016886
DOWNLOAD EBOOKWith a simple approach that includes real-time applications and algorithms, this book covers the theory of model predictive control (MPC).
Author: Stephen P. Boyd
Publisher: Cambridge University Press
Published: 2004-03-08
Total Pages: 744
ISBN-13: 9780521833783
DOWNLOAD EBOOKConvex optimization problems arise frequently in many different fields. This book provides a comprehensive introduction to the subject, and shows in detail how such problems can be solved numerically with great efficiency. The book begins with the basic elements of convex sets and functions, and then describes various classes of convex optimization problems. Duality and approximation techniques are then covered, as are statistical estimation techniques. Various geometrical problems are then presented, and there is detailed discussion of unconstrained and constrained minimization problems, and interior-point methods. The focus of the book is on recognizing convex optimization problems and then finding the most appropriate technique for solving them. It contains many worked examples and homework exercises and will appeal to students, researchers and practitioners in fields such as engineering, computer science, mathematics, statistics, finance and economics.