Cover Image

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

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Nabou, Yassine, Toma, Lucian, Necoara, Ion
Format:	Preprint
Published:	2025
Subjects:	Optimization and Control
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Regularized higher-order Taylor approximation methods for nonlinear least-squares
by: Nabou, Yassine, et al.
Published: (2025)

Moving higher-order Taylor approximations method for smooth constrained minimization problems
by: Nabou, Yassine, et al.
Published: (2024)

Proximal gradient methods with inexact oracle of degree q for composite optimization
by: Nabou, Yassine, et al.
Published: (2024)

Efficiency of higher-order algorithms for minimizing composite functions
by: Nabou, Yassine, et al.
Published: (2022)

Nonmonotone higher-order Taylor approximation methods for composite problems
by: Nabou, Yassine
Published: (2025)

Inexact Gauss-Newton methods with matrix approximation by sampling for nonlinear least-squares and systems
by: Bellavia, Stefania, et al.
Published: (2023)

A stochastic perturbed augmented Lagrangian method for smooth convex constrained minimization
by: Singh, Nitesh Kumar, et al.
Published: (2025)

A stochastic moving ball approximation method for smooth convex constrained minimization
by: Singh, Nitesh Kumar, et al.
Published: (2024)

Convergence analysis of linearized $\ell_q$ penalty methods for nonconvex optimization with nonlinear equality constraints
by: Bourkhissi, Lahcen El, et al.
Published: (2025)

Higher-order tensor methods for minimizing difference of convex functions
by: Necoara, Ion
Published: (2024)

Complexity of a linearized augmented Lagrangian method for nonconvex minimization with nonlinear equality constraints
by: Bourkhissi, Lahcen El, et al.
Published: (2023)

Coordinate projected gradient descent minimization and its application to orthogonal nonnegative matrix factorization
by: Chorobura, Flavia, et al.
Published: (2025)

Complexity analysis of regularization methods for implicitly constrained least squares
by: Onwunta, Akwum, et al.
Published: (2023)

Coordinate descent methods beyond smoothness and separability
by: Chorobura, Flavia, et al.
Published: (2024)

Random coordinate descent methods for nonseparable composite optimization
by: Chorobura, Flavia, et al.
Published: (2022)

Complexity of linearized quadratic penalty for optimization with nonlinear equality constraints
by: Bourkhissi, Lahcen El, et al.
Published: (2024)

Mini-batch stochastic subgradient for functional constrained optimization
by: Singh, Nitesh Kumar, et al.
Published: (2024)

Convergence rates for an inexact linearized ADMM for nonsmooth nonconvex optimization with nonlinear equality constraints
by: Bourkhissi, Lahcen El, et al.
Published: (2025)

Convergence analysis of stochastic higher-order majorization-minimization algorithms
by: Lupu, Daniela, et al.
Published: (2021)

Stochastic halfspace approximation method for convex optimization with nonsmooth functional constraints
by: Singh, Nitesh Kumar, et al.
Published: (2024)

A derivative-free regularization algorithm for equality constrained nonlinear least squares problems
by: Chen, Xi, et al.
Published: (2025)

Random minibatch subgradient algorithms for convex problems with functional constraints
by: Nedich, Angelia, et al.
Published: (2019)

A systematic approach to general higher-order majorization-minimization algorithms for (non)convex optimization
by: Necoara, Ion, et al.
Published: (2020)

Exact representation and efficient approximations of linear model predictive control laws via HardTanh type deep neural networks
by: Lupu, Daniela, et al.
Published: (2024)

Monotone and nonmonotone linearized block coordinate descent methods for nonsmooth composite optimization problems
by: Nabou, Yassine, et al.
Published: (2025)

Stochastic subgradient for composite optimization with functional constraints
by: Necoara, Ion, et al.
Published: (2022)

Dynamic inverse problems: Online regularisation theory
by: Jauhiainen, Jyrki, et al.
Published: (2026)

On the Worst-Case Analysis of Cyclic Block Coordinate Descent type Algorithms
by: Kamri, Yassine, et al.
Published: (2025)

A derivative-free Levenberg-Marquardt method for sparse nonlinear least squares problems
by: Feng, Yuchen, et al.
Published: (2025)

A variable dimension sketching strategy for nonlinear least-squares
by: Bellavia, Stefania, et al.
Published: (2025)

An adaptive forward-backward-forward splitting algorithm for solving pseudo-monotone inclusions
by: Chorobura, Flavia, et al.
Published: (2025)

Anderson acceleration of derivative-free projection methods for constrained monotone nonlinear equations
by: Jin, Jiachen, et al.
Published: (2024)

Efficiency of stochastic coordinate proximal gradient methods on nonseparable composite optimization
by: Necoara, I., et al.
Published: (2021)

An efficient sieving based secant method for sparse optimization problems with least-squares constraints
by: Li, Qian, et al.
Published: (2023)

Complexity of Linearized Perturbed Augmented Lagrangian Methods for Nonsmooth Nonconvex Optimization with Nonlinear Equality Constraints
by: Bourkhissi, Lahcen El, et al.
Published: (2025)

Reduced order method based Anderson-type acceleration method for nonlinear least square problems and large scale ill-posed problems
by: Ito, Kazufumi, et al.
Published: (2025)

Smooth, globally Polyak-Łojasiewicz functions are nonlinear least-squares
by: Boumal, Nicolas, et al.
Published: (2026)

Geometrically robust least squares through manifold optimization
by: Coulson, Jeremy, et al.
Published: (2025)

Variable projection framework for the reduced-rank matrix approximation problem by weighted least-squares
by: Terray, Pascal
Published: (2025)

A least-square method for non-asymptotic identification in linear switching control
by: Sun, Haoyuan, et al.
Published: (2024)