Proportional-integral projected gradient method for conic optimization
From MaRDI portal
Abstract: Conic optimization is the minimization of a differentiable convex objective function subject to conic constraints. We propose a novel primal-dual first-order method for conic optimization, named proportional-integral projected gradient method (PIPG). PIPG ensures that both the primal-dual gap and the constraint violation converge to zero at the rate of (O(1/k)), where (k) is the number of iterations. If the objective function is strongly convex, PIPG improves the convergence rate of the primal-dual gap to (O(1/k^2)). Further, unlike any existing first-order methods, PIPG also improves the convergence rate of the constraint violation to (O(1/k^3)). We demonstrate the application of PIPG in constrained optimal control problems.
Recommendations
- Interior Gradient and Proximal Methods for Convex and Conic Optimization
- Inertial accelerated primal-dual methods for linear equality constrained convex optimization problems
- Inexact primal-dual gradient projection methods for nonlinear optimization on convex set
- A projected gradient and constraint linearization method for nonlinear model predictive control
- First-order methods for convex optimization
Cites work
- scientific article; zbMATH DE number 729680 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- A differential equation for modeling Nesterov's accelerated gradient method: theory and insights
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- A first-order primal-dual algorithm for convex problems with applications to imaging
- A new primal-dual algorithm for minimizing the sum of three functions with a linear operator
- A primal-dual fixed point algorithm for minimization of the sum of three convex separable functions
- A primal–dual fixed point algorithm for convex separable minimization with applications to image restoration
- Accelerated first-order primal-dual proximal methods for linearly constrained composite convex programming
- An accelerated linearized alternating direction method of multipliers
- An introduction to continuous optimization for imaging
- Conic optimization via operator splitting and homogeneous self-dual embedding
- Convex analysis and monotone operator theory in Hilbert spaces
- Dual extrapolation and its applications to solving variational inequalities and related problems
- Embedded Online Optimization for Model Predictive Control at Megahertz Rates
- Fast alternating direction optimization methods
- Lectures on convex optimization
- Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
- Mass-spring-damper networks for distributed optimization in non-Euclidean spaces
- OSQP: an operator splitting solver for quadratic programs
- On implementing a primal-dual interior-point method for conic quadratic optimization
- On the \(O(1/n)\) convergence rate of the Douglas-Rachford alternating direction method
- On the ergodic convergence rates of a first-order primal-dual algorithm
- Preconditioned alternating projection algorithms for maximum \textit{a posteriori} ECT reconstruction
- Primal-dual first-order methods with \({\mathcal {O}(1/\varepsilon)}\) iteration-complexity for cone programming
- Projecting onto the Intersection of a Cone and a Sphere
- Prox-Method with Rate of Convergence O(1/t) for Variational Inequalities with Lipschitz Continuous Monotone Operators and Smooth Convex-Concave Saddle Point Problems
This page was built for publication: Proportional-integral projected gradient method for conic optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2151872)
