A fast method for obtaining convex combination coefficients

DOI10.1016/J.AUTOMATICA.2023.110975MaRDI QIDQ6103045zbMATH OpenOpenAlexFDO

Authors João Paulo Vieira, Roberto K. H. Galvão, Rubens J. M. Afonso

Publication date 26 June 2023

Published in Automatica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.automatica.2023.110975

zbMATH Keywords

convex combinationpolytopespredictive controlalgorithms and software

Mathematics Subject Classification ID

Model predictive control (93B45) Computational methods for problems pertaining to systems and control theory (93-08)

Recommendations

• Fast first-order methods for minimizing convex composite functions
• A note on the impact of the convex combination factor of a convex combination projection algorithm
• Fast computation of multinomial coefficients
• The combination of approximate solutions for accelerating the convergence
• Fast stability checking for the convex combination of stable polynomials
• Improving the speed of convergence in the method of projections onto convex sets
• A Gauss-Newton method for convex composite optimization
• Fast alternating linearization methods for minimizing the sum of two convex functions
• Coconvex approximation by hybrid polynomials
• The combination projection method for solving convex feasibility problems

Cites work

• A local search algorithm for ray-convex polyhedron intersection
• Convex interpolation control with formal guarantees for disturbed and constrained nonlinear systems
• On ray shooting in convex polytopes
• Ray shooting and intersection searching amidst fat convex polyhedra in 3-space
• Robust model predictive control using tubes.
• Set-based control for disturbed piecewise affine systems with state and actuation constraints

This page was built for publication: A fast method for obtaining convex combination coefficients

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6103045)