output
20002026
most citedObservation of a new particle in the search for the Standard Model Higgs boson with the ATLAS detector at the LHC

10.9k citations

Showing math.OCShow all

28 papers · 1 filter

math.OC2025★ 5 cited

An accelerated randomized Bregman-Kaczmarz method for strongly convex linearly constraint optimization

Lionel Tondji, Dirk A. Lorenz, Ion Necoara

In this paper, we propose a randomized accelerated method for the minimization of a strongly convex function under linear constraints. The method is of Kaczmarz-type, i.e. it only…

math.OC2025★ 2 cited

Modified projected Gauss-Newton method for constrained nonlinear least-squares: application to power flow analysis

Yassine Nabou, Lucian Toma, Ion Necoara

In this paper, we consider a modified projected Gauss-Newton method for solving constrained nonlinear least-squares problems. We assume that the functional constraints are smooth a…

math.OC2025★ 1 cited

Coordinate projected gradient descent minimization and its application to orthogonal nonnegative matrix factorization

Flavia Chorobura, Daniela Lupu, Ion Necoara

In this paper we consider large-scale composite nonconvex optimization problems having the objective function formed as a sum of three terms, first has block coordinate-wise Lipsch…

math.OC2024★ 1 cited

A stochastic moving ball approximation method for smooth convex constrained minimization

Nitesh Kumar Singh, Ion Necoara

In this paper, we consider constrained optimization problems with convex, smooth objective and constraints. We propose a new stochastic gradient algorithm, called the Stochastic Mo…

math.OC2024★ 7 cited

Mini-batch stochastic subgradient for functional constrained optimization

Nitesh Kumar Singh, Ion Necoara, Vyacheslav Kungurtsev

In this paper we consider finite sum composite convex optimization problems with many functional constraints. The objective function is expressed as a finite sum of two terms, one…

math.OC2022★ 5 cited

Random coordinate descent methods for nonseparable composite optimization

Flavia Chorobura, Ion Necoara

In this paper we consider large-scale composite optimization problems having the objective function formed as a sum of two terms (possibly nonconvex), one has (block) coordinate-wi…

math.OC2022★ 3 cited

Efficiency of higher-order algorithms for minimizing composite functions

Yassine Nabou, Ion Necoara

Composite minimization involves a collection of functions which are aggregated in a nonsmooth manner. It covers, as a particular case, smooth approximation of minimax games, minimi…

math.OC2021★ 1 cited

Efficiency of stochastic coordinate proximal gradient methods on nonseparable composite optimization

I. Necoara, F. Chorobura

This paper deals with composite optimization problems having the objective function formed as the sum of two terms, one has Lipschitz continuous gradient along random subspaces and…

math.OC2021★ 2 cited

Convergence analysis of stochastic higher-order majorization-minimization algorithms

Daniela Lupu, Ion Necoara

Majorization-minimization schemes are a broad class of iterative methods targeting general optimization problems, including nonconvex, nonsmooth and stochastic. These algorithms mi…

math.OC2020

Static Output Feedback in an Anisotropic Norm Setup Revisited

Adrian-Mihail Stoica, Isaac Yaesh

The synthesis problem of static output feedback controllers within the anistropic-norm setup is revisited. A tractable synthesis approach involving iterations over a convex optimiz…

math.OC2019★ 2 cited

Linear convergence of dual coordinate descent on non-polyhedral convex problems

Ion Necoara, Olivier Fercoq

This paper deals with constrained convex problems, where the objective function is smooth strongly convex and the feasible set is given as the intersection of a large number of clo…

math.OC2019

Minibatch stochastic subgradient-based projection algorithms for solving convex inequalities

Ion Necoara, Angelia Nedich

This paper deals with the convex feasibility problem, where the feasible set is given as the intersection of a (possibly infinite) number of closed convex sets. We assume that each…

math.OC2019

A Globally Convergent Penalty-Based Gauss-Newton Algorithm with Applications

Ilyes Mezghani, Quoc Tran-Dinh, Ion Necoara +1

We propose a globally convergent Gauss-Newton algorithm for finding a local optimal solution of a non-convex and possibly non-smooth optimization problem. The algorithm that we pre…

math.OC2019★ 13 cited

Random minibatch subgradient algorithms for convex problems with functional constraints

Angelia Nedich, Ion Necoara

In this paper we consider non-smooth convex optimization problems with (possibly) infinite intersection of constraints. In contrast to the classical approach, where the constraints…

math.OC2019

H2 model reduction of linear network systems by moment matching and optimization

I. Necoara, T. C. Ionescu

In this paper we study the problem of model reduction of linear network systems. We aim at computing a reduced order stable approximation of the network with the same topology and…

math.OC2018★ 3 cited

Composite Convex Optimization with Global and Local Inexact Oracles

Tianxiao Sun, Ion Necoara, Quoc Tran-Dinh

We introduce new global and local inexact oracle concepts for a wide class of convex functions in composite convex minimization. Such inexact oracles naturally come from primal-dua…

math.OC2016

Stability analysis of a hypothalamic-pituitary-adrenal axis model with inclusion of glucocorticoid receptor and memory

Eva Kaslik, Dan Bogdan Navolan, Mihaela Neamtu

This paper analyzes a four-dimensional model of the hypothalamic-pituitary-adrenal (HPA) axis that includes the influence of the glucocorticoid receptor in the pituitary. Due to th…

math.OC2015★ 1 cited

Complexity of first order inexact Lagrangian and penalty methods for conic convex programming

Ion Necoara, Andrei Patrascu, Francois Glineur

In this paper we present a complete iteration complexity analysis of inexact first order Lagrangian and penalty methods for solving cone constrained convex problems that have or ma…

math.OC2014★ 8 cited

Iteration complexity analysis of dual first order methods for conic convex programming

Ion Necoara, Andrei Patrascu

In this paper we provide a detailed analysis of the iteration complexity of dual first order methods for solving conic convex problems. When it is difficult to project on the prima…

math.OC2014

On linear convergence of a distributed dual gradient algorithm for linearly constrained separable convex problems

Ion Necoara, Valentin Nedelcu

In this paper we propose a distributed dual gradient algorithm for minimizing linearly constrained separable convex problems and analyze its rate of convergence. In particular, we…

math.OC2013★ 1 cited

Efficient random coordinate descent algorithms for large-scale structured nonconvex optimization

A. Patrascu, I. Necoara

In this paper we analyze several new methods for solving nonconvex optimization problems with the objective function formed as a sum of two terms: one is nonconvex and smooth, and…

math.OC2013★ 51 cited

Improved Dual Decomposition Based Optimization for DSL Dynamic Spectrum Management

Paschalis Tsiaflakis, Ion Necoara, Johan A. K. Suykens +1

Dynamic spectrum management (DSM) has been recognized as a key technology to significantly improve the performance of digital subscriber line (DSL) broadband access networks. The b…

math.OC2013★ 2 cited

A random coordinate descent algorithm for optimization problems with composite objective function and linear coupled constraints

Ion Necoara, Andrei Patrascu

In this paper we propose a variant of the random coordinate descent method for solving linearly constrained convex optimization problems with composite objective functions. If the…

math.OC2013

Efficient parallel coordinate descent algorithm for convex optimization problems with separable constraints: application to distributed MPC

Ion Necoara, Dragos Clipici

In this paper we propose a parallel coordinate descent algorithm for solving smooth convex optimization problems with separable constraints that may arise e.g. in distributed model…