A projected gradient and constraint linearization method for nonlinear model predictive control
From MaRDI portal
Abstract: Projected Gradient Descent denotes a class of iterative methods for solving optimization programs. Its applicability to convex optimization programs has gained significant popularity for its intuitive implementation that involves only simple algebraic operations. In fact, if the projection onto the feasible set is easy to compute, then the method has low complexity. On the other hand, when the problem is nonconvex, e.g. because of nonlinear equality constraints, the projection becomes hard and thus impractical. In this paper, we propose a projected gradient method for Nonlinear Programs (NLPs) that only requires projections onto the linearization of the nonlinear constraints around the current iterate, similarly to Sequential Quadratic Programming (SQP). Although the projection is easier to compute, it makes the intermediate steps unfeasible for the original problem. As a result, the gradient method does not fall either into the projected gradient descent approaches, because the projection is not performed onto the original nonlinear manifold, or into the standard SQP, since second-order information is not used. For nonlinear smooth optimization problems, we analyze the similarities of the proposed method with SQP and assess its local and global convergence to a Karush-Kuhn-Tucker (KKT) point of the original problem. Further, we show that nonlinear Model Predictive Control (MPC) is a promising application of the proposed method, due to the sparsity of the resulting optimization problem. We illustrate the computational efficiency of the proposed method in a numerical example with box constraints on the control input and a quadratic terminal constraint on the state variable.
Recommendations
- Projected gradient methods for linearly constrained problems
- A projected Newton method for minimization problems with nonlinear inequality constraints
- scientific article; zbMATH DE number 18060
- scientific article; zbMATH DE number 3902415
- Convergence of a projected gradient method with trust region for nonlinear constrained optimization†
Cites work
- scientific article; zbMATH DE number 1818892 (Why is no real title available?)
- scientific article; zbMATH DE number 3850830 (Why is no real title available?)
- scientific article; zbMATH DE number 4199499 (Why is no real title available?)
- scientific article; zbMATH DE number 3718477 (Why is no real title available?)
- scientific article; zbMATH DE number 3736490 (Why is no real title available?)
- scientific article; zbMATH DE number 88930 (Why is no real title available?)
- scientific article; zbMATH DE number 3583207 (Why is no real title available?)
- scientific article; zbMATH DE number 724208 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- scientific article; zbMATH DE number 780774 (Why is no real title available?)
- scientific article; zbMATH DE number 852532 (Why is no real title available?)
- A Sequential Quadratic Programming Algorithm Using an Incomplete Solution of the Subproblem
- A quasi-infinite horizon nonlinear model predictive control scheme with guaranteed stability
- A recursive quadratic programming algorithm that uses differentiable exact penalty functions
- A stable approach to Newton's method for general mathematical programming problems in R\(^n\)
- Accelerated gradient methods for nonconvex nonlinear and stochastic programming
- An algorithm for linearly constrained convex nondifferentiable minimization problems
- An online active set strategy to overcome the limitations of explicit MPC
- Contractive model predictive control for constrained nonlinear systems
- Inexact Newton Methods
- Inexact SQP Interior Point Methods and Large Scale Optimal Control Problems
- Introductory lectures on convex optimization. A basic course.
- Lifted collocation integrators for direct optimal control in ACADO toolkit
- Newton's method for constrained optimization
- Nonlinear Optimization by Successive Linear Programming
- Nonlinear model predictive control via feasibility-perturbed sequential quadratic programming
- Numerical Optimization
- On the Local Convergence of Quasi-Newton Methods for Constrained Optimization
- On the Local and Superlinear Convergence of Quasi-Newton Methods
- Perturbed Kuhn-Tucker points and rates of convergence for a class of nonlinear-programming algorithms
- Quasi-Newton Methods, Motivation and Theory
- SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
- Sensitivity analysis for nonlinear programming using penalty methods
- Superlinearly convergent variable metric algorithms for general nonlinear programming problems
- The Gradient Projection Method for Nonlinear Programming. Part II. Nonlinear Constraints
- The TOMLAB optimization environment in MATLAB
- Updating Quasi-Newton Matrices with Limited Storage
Cited in
(8)- \texttt{acados} -- a modular open-source framework for fast embedded optimal control
- Offline model predictive control based on weighted projection over polytopes
- Proximal gradient/semismooth Newton methods for projection onto a polyhedron via the duality-gap-active-set strategy
- Proportional-integral projected gradient method for conic optimization
- Convergence guaranteed nonlinear constraint model predictive control via I/O linearization
- Local Decay of Residuals in Dual Gradient Method with Soft State Constraints
- Sign projected gradient flow: a continuous-time approach to convex optimization with linear equality constraints
- ParNMPC -- a parallel optimisation toolkit for real-time nonlinear model predictive control
Describes a project that uses
Uses Software
This page was built for publication: A projected gradient and constraint linearization method for nonlinear model predictive control
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4563378)
