Pages that link to "Item:Q5173274"
From MaRDI portal
The following pages link to Computational Complexity of Inexact Gradient Augmented Lagrangian Methods: Application to Constrained MPC (Q5173274):
Displaying 28 items.
- An inexact dual fast gradient-projection method for separable convex optimization with linear coupled constraints (Q255080) (← links)
- Adaptive inexact fast augmented Lagrangian methods for constrained convex optimization (Q519779) (← links)
- Adaptive smoothing algorithms for nonsmooth composite convex minimization (Q523569) (← links)
- Computational complexity certification for dual gradient method: application to embedded MPC (Q894005) (← links)
- Optimal move blocking strategies for model predictive control (Q900643) (← links)
- Metric selection in fast dual forward-backward splitting (Q901087) (← links)
- A dual gradient-projection algorithm for model predictive control in fixed-point arithmetic (Q1689378) (← links)
- A primal majorized semismooth Newton-CG augmented Lagrangian method for large-scale linearly constrained convex programming (Q1694389) (← links)
- General convergence analysis of stochastic first-order methods for composite optimization (Q2032020) (← links)
- An inexact proximal augmented Lagrangian framework with arbitrary linearly convergent inner solver for composite convex optimization (Q2062324) (← links)
- Augmented Lagrangian optimization under fixed-point arithmetic (Q2208540) (← links)
- Iteration complexity of inexact augmented Lagrangian methods for constrained convex programming (Q2220658) (← links)
- An adaptive primal-dual framework for nonsmooth convex minimization (Q2220901) (← links)
- A software framework for embedded nonlinear model predictive control using a gradient-based augmented Lagrangian approach (GRAMPC) (Q2331376) (← links)
- Distributed model predictive control method for optimal coordination of signal splits in urban traffic networks (Q2789982) (← links)
- Complexity Certifications of First-Order Inexact Lagrangian Methods for General Convex Programming: Application to Real-Time MPC (Q2798546) (← links)
- Iteration complexity analysis of dual first-order methods for conic convex programming (Q2815553) (← links)
- Convergence analysis of approximate primal solutions in dual first-order methods (Q2834559) (← links)
- A Smooth Primal-Dual Optimization Framework for Nonsmooth Composite Convex Minimization (Q4600841) (← links)
- Complexity of first-order inexact Lagrangian and penalty methods for conic convex programming (Q4622887) (← links)
- On the Nonergodic Convergence Rate of an Inexact Augmented Lagrangian Framework for Composite Convex Programming (Q5219732) (← links)
- An adaptive constraint tightening approach to linear model predictive control based on approximation algorithms for optimization (Q5745041) (← links)
- A linear algebra perspective on the random multi-block ADMM: the QP case (Q6142559) (← links)
- Convergence of the projection and contraction methods for solving bilevel variational inequality problems (Q6143589) (← links)
- Stochastic inexact augmented Lagrangian method for nonconvex expectation constrained optimization (Q6179875) (← links)
- Mini-batch stochastic subgradient for functional constrained optimization (Q6565290) (← links)
- Exact representation and efficient approximations of linear model predictive control laws via HardTanh type deep neural networks (Q6569378) (← links)
- A stochastic moving ball approximation method for smooth convex constrained minimization (Q6642788) (← links)
