The following pages link to Ion Necoara (Q461435):
Displaying 50 items.
- A random coordinate descent algorithm for optimization problems with composite objective function and linear coupled constraints (Q461437) (← links)
- Efficient random coordinate descent algorithms for large-scale structured nonconvex optimization (Q486721) (← links)
- Adaptive inexact fast augmented Lagrangian methods for constrained convex optimization (Q519779) (← links)
- (Q846930) (redirect page) (← links)
- Interior-point Lagrangian decomposition method for separable convex optimization (Q846931) (← links)
- Computational complexity certification for dual gradient method: application to embedded MPC (Q894005) (← links)
- On linear convergence of a distributed dual gradient algorithm for linearly constrained separable convex problems (Q1689375) (← links)
- Composite convex optimization with global and local inexact oracles (Q1986105) (← links)
- General convergence analysis of stochastic first-order methods for composite optimization (Q2032020) (← links)
- Minibatch stochastic subgradient-based projection algorithms for feasibility problems with convex inequalities (Q2044573) (← links)
- Model reduction with pole-zero placement and high order moment matching (Q2123208) (← links)
- Path-following gradient-based decomposition algorithms for separable convex optimization (Q2249817) (← links)
- Random minibatch subgradient algorithms for convex problems with functional constraints (Q2338088) (← links)
- Constructive solution of inverse parametric linear/quadratic programming problems (Q2359785) (← links)
- Random block coordinate descent methods for linearly constrained optimization over networks (Q2401516) (← links)
- Linear convergence of first order methods for non-strongly convex optimization (Q2414900) (← links)
- Stabilization of max-plus-linear systems using model predictive control: the unconstrained case (Q2440680) (← links)
- Stable model predictive control for constrained max-plus-linear systems (Q2465673) (← links)
- Fast inexact decomposition algorithms for large-scale separable convex optimization (Q2790883) (← links)
- Complexity Certifications of First-Order Inexact Lagrangian Methods for General Convex Programming: Application to Real-Time MPC (Q2798546) (← links)
- Fully Inverse Parametric Linear/Quadratic Programming Problems via Convex Liftings (Q2798547) (← links)
- Iteration complexity analysis of dual first-order methods for conic convex programming (Q2815553) (← links)
- Smoothing Techniques-Based Distributed Model Predictive Control Algorithms for Networks (Q2926539) (← links)
- Random Coordinate Descent Methods for <inline-formula> <tex-math notation="TeX">$\ell_{0}$</tex-math></inline-formula> Regularized Convex Optimization (Q2982665) (← links)
- Rate Analysis of Inexact Dual First-Order Methods Application to Dual Decomposition (Q2983168) (← links)
- Parallel Random Coordinate Descent Method for Composite Minimization: Convergence Analysis and Error Bounds (Q3465244) (← links)
- Model predictive control for uncertain max–min-plus-scaling systems (Q3543003) (← links)
- Robust control of constrained max-plus-linear systems (Q3626931) (← links)
- Nonasymptotic convergence of stochastic proximal point algorithms for constrained convex optimization (Q4558525) (← links)
- On the Convergence of Inexact Projection Primal First-Order Methods for Convex Minimization (Q4559493) (← links)
- Improved Dual Decomposition Based Optimization for DSL Dynamic Spectrum Management (Q4570195) (← links)
- Complexity of first-order inexact Lagrangian and penalty methods for conic convex programming (Q4622887) (← links)
- Every Continuous Nonlinear Control System Can be Obtained by Parametric Convex Programming (Q4974331) (← links)
- Application of a Smoothing Technique to Decomposition in Convex Optimization (Q4974416) (← links)
- Stochastic block projection algorithms with extrapolation for convex feasibility problems (Q5058397) (← links)
- Randomized sketch descent methods for non-separable linearly constrained optimization (Q5077024) (← links)
- Computational Complexity of Inexact Gradient Augmented Lagrangian Methods: Application to Constrained MPC (Q5173274) (← links)
- Faster Randomized Block Kaczmarz Algorithms (Q5203967) (← links)
- Randomized Projection Methods for Convex Feasibility: Conditioning and Convergence Rates (Q5242933) (← links)
- Finite-Horizon Min–Max Control of Max-Plus-Linear Systems (Q5282152) (← links)
- An Inexact Perturbed Path-Following Method for Lagrangian Decomposition in Large-Scale Separable Convex Optimization (Q5300519) (← links)
- Random Coordinate Descent Algorithms for Multi-Agent Convex Optimization Over Networks (Q5353298) (← links)
- An adaptive constraint tightening approach to linear model predictive control based on approximation algorithms for optimization (Q5745041) (← links)
- $H_2$ Model Reduction of Linear Network Systems by Moment Matching and Optimization (Q5853949) (← links)
- Linear Convergence of Random Dual Coordinate Descent on Nonpolyhedral Convex Problems (Q5870350) (← links)
- Efficiency of higher-order algorithms for minimizing composite functions (Q6155068) (← links)
- Random Coordinate Descent Methods for Nonseparable Composite Optimization (Q6176428) (← links)
- Linear convergence of dual coordinate descent on non-polyhedral convex problems (Q6329159) (← links)
- Coordinate descent methods beyond smoothness and separability (Q6498410) (← links)
- Efficiency of stochastic coordinate proximal gradient methods on nonseparable composite optimization (Q6504474) (← links)
