Ion Necoara - Citegraph

Author Info

Name	Affiliation	Papers
ION NECOARA	Automatic Control and Systems Engineering Department, Politehnica University of Bucharest, Bucharest, Romania 060042	46
Collaborators	Citations	PageRank
49	311	27.33
Referers	Referees	References
519	384	362

Search Limit

100519

Publications (46 rows)

Collaborators (49 rows)

Referers (100 rows)

Referees (100 rows)

Title	Citations	PageRank	Year
Model reduction with pole-zero placement and high order moment matching	0	0.34	2022
General Convergence Analysis Of Stochastic First-Order Methods For Composite Optimization	1	0.36	2021
Minibatch Stochastic Subgradient-Based Projection Algorithms For Feasibility Problems With Convex Inequalities	0	0.34	2021
A Suboptimal H-2 Clustering-Based Model Reduction Approach For Linear Network Systems	0	0.34	2020
Optimal Time-Domain Moment Matching With Partial Placement Of Poles And Zeros	0	0.34	2020
<inline-formula><tex-math notation="LaTeX">$H_2$</tex-math></inline-formula> Model Reduction of Linear Network Systems by Moment Matching and Optimization	0	0.34	2020
Complexity of first-order inexact Lagrangian and penalty methods for conic convex programming.	2	0.36	2019
Almost surely constrained convex optimization	1	0.35	2019
Randomized Projection Methods for Convex Feasibility: Conditioning and Convergence Rates	1	0.35	2019
Random Gradient Algorithms For Convex Minimization Over Intersection Of Simple Sets	0	0.34	2019
Parameter Selection For Best H-2 Moment Matching-Based Model Approximation Through Gradient Optimization	0	0.34	2019
OR-SAGA: Over-relaxed stochastic average gradient mapping algorithms for finite sum minimization	0	0.34	2018
On the Convergence of Inexact Projection Primal First-Order Methods for Convex Minimization.	1	0.37	2018
Random block coordinate descent methods for linearly constrained optimization over networks	5	0.45	2017
Nonasymptotic convergence of stochastic proximal point methods for constrained convex optimization.	5	0.52	2017
Constructive Solution of Inverse Parametric Linear/Quadratic Programming Problems.	8	0.59	2017
Adaptive inexact fast augmented Lagrangian methods for constrained convex optimization	1	0.36	2017
Optimal voltage control for loss minimization based on sequential convex programming	0	0.34	2016
Complexity certifications of inexact projection primal gradient method for convex problems: Application to embedded MPC	0	0.34	2016
Parallel Random Coordinate Descent Method for Composite Minimization: Convergence Analysis and Error Bounds.	11	0.54	2016
Iteration complexity analysis of dual first-order methods for conic convex programming.	7	0.49	2016
On linear convergence of a distributed dual gradient algorithm for linearly constrained separable convex problems	17	0.76	2015
A fully distributed dual gradient method with linear convergence for large-scale separable convex problems	0	0.34	2015
Efficient random coordinate descent algorithms for large-scale structured nonconvex optimization	24	1.21	2015
Computational complexity certification for dual gradient method: Application to embedded MPC	7	0.53	2015
Random Coordinate Descent Methods for ℓ0 Regularized Convex Optimization.	0	0.34	2015
Computational Complexity of Inexact Gradient Augmented Lagrangian Methods: Application to Constrained MPC.	21	0.94	2014
A proximal alternating minimization method for ℓ0-regularized nonlinear optimization problems: application to state estimation	0	0.34	2014
Path-following gradient-based decomposition algorithms for separable convex optimization	6	0.41	2014
A random coordinate descent algorithm for optimization problems with composite objective function and linear coupled constraints	32	1.27	2014
Distributed model predictive control of leader-follower systems using an interior point method with efficient computations	1	0.36	2013
Linear model predictive control based on approximate optimal control inputs and constraint tightening.	2	0.36	2013
An Inexact Perturbed Path-Following Method for Lagrangian Decomposition in Large-Scale Separable Convex Optimization.	18	0.79	2013
Iteration complexity of an inexact augmented Lagrangian method for constrained MPC	4	0.48	2012
Improved dual decomposition based optimization for DSL dynamic spectrum management	20	1.05	2010
Fast primal-dual projected linear iterations for distributed consensus in constrained convex optimization	3	0.43	2010
Distributed nonlinear optimal control using sequential convex programming and smoothing techniques	8	0.68	2009
A dual interior-point distributed algorithm for large-scale data networks optimization	0	0.34	2009
An improved dual decomposition approach to DSL dynamic spectrum management	2	0.43	2009
Distributed Control over Networks Using Smoothing Techniques	0	0.34	2009
Every Continuous Nonlinear Control System Can be Obtained by Parametric Convex Programming	18	1.51	2008
Application of a Smoothing Technique to Decomposition in Convex Optimization	63	3.98	2008
Stabilization of max-plus-linear systems using model predictive control: The unconstrained case	4	0.59	2008
Stable Model Predictive Control for Constrained Max-Plus-Linear Systems	6	0.50	2007
Finite-Horizon Min–Max Control of Max-Plus-Linear Systems	10	0.85	2007
Robust hybrid MPC applied to the design of an adaptive cruise controller for a road vehicle	2	0.41	2006