A Projected Gradient and Constraint Linearization Method for Nonlinear Model Predictive Control
From MaRDI portal
Publication:4563378
DOI10.1137/16M1098103zbMath1391.90581arXiv1610.06834OpenAlexW2545460640MaRDI QIDQ4563378
Giampaolo Torrisi, Roy S. Smith, Manfred Morari, Sergio Grammatico
Publication date: 1 June 2018
Published in: SIAM Journal on Control and Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1610.06834
sequential quadratic programmingnonlinear programmingnonlinear model predictive controlfirst-order methods
Related Items
\texttt{acados} -- a modular open-source framework for fast embedded optimal control ⋮ Proximal gradient/semismooth Newton methods for projection onto a polyhedron via the duality-gap-active-set strategy ⋮ ParNMPC – a parallel optimisation toolkit for real-time nonlinear model predictive control
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Accelerated gradient methods for nonconvex nonlinear and stochastic programming
- An algorithm for linearly constrained convex nondifferentiable minimization problems
- A quasi-infinite horizon nonlinear model predictive control scheme with guaranteed stability
- Introductory lectures on convex optimization. A basic course.
- Lifted collocation integrators for direct optimal control in ACADO toolkit
- Nonlinear model predictive control via feasibility-perturbed sequential quadratic programming
- A stable approach to Newton's method for general mathematical programming problems in R\(^n\)
- Newton's method for constrained optimization
- A recursive quadratic programming algorithm that uses differentiable exact penalty functions
- Updating Quasi-Newton Matrices with Limited Storage
- Inexact Newton Methods
- On the Local Convergence of Quasi-Newton Methods for Constrained Optimization
- Perturbed Kuhn-Tucker points and rates of convergence for a class of nonlinear-programming algorithms
- Quasi-Newton Methods, Motivation and Theory
- Sensitivity analysis for nonlinear programming using penalty methods
- Superlinearly convergent variable metric algorithms for general nonlinear programming problems
- Numerical Optimization
- Contractive model predictive control for constrained nonlinear systems
- Nonlinear Optimization by Successive Linear Programming
- On the Local and Superlinear Convergence of Quasi-Newton Methods
- A Sequential Quadratic Programming Algorithm Using an Incomplete Solution of the Subproblem
- Inexact SQP Interior Point Methods and Large Scale Optimal Control Problems
- SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
- An online active set strategy to overcome the limitations of explicit MPC
- The Gradient Projection Method for Nonlinear Programming. Part II. Nonlinear Constraints
This page was built for publication: A Projected Gradient and Constraint Linearization Method for Nonlinear Model Predictive Control
