English
Related papers

Related papers: Improving Newton's method performance by parametri…

200 papers

In this paper, we propose new methods to efficiently solve convex optimization problems encountered in sparse estimation, which include a new quasi-Newton method that avoids computing the Hessian matrix and improves efficiency, and we prove…

Optimization and Control · Mathematics 2023-09-06 Ryosuke Shimmura , Joe Suzuki

This paper proposes new proximal Newton-type methods with a diagonal metric for solving composite optimization problems whose objective function is the sum of a twice continuously differentiable function and a proper closed directionally…

Optimization and Control · Mathematics 2023-10-11 Shotaro Yagishita , Shummin Nakayama

A stable numerical solution of the steady Stokes problem requires compatibility between the choice of velocity and pressure approximation that has traditionally proven problematic for meshless methods. In this work, we present a…

Numerical Analysis · Mathematics 2016-11-15 Nathaniel Trask , Martin Maxey , Xiaozhe Hu

We study a Newton-like method for the minimization of an objective function that is the sum of a smooth convex function and an l-1 regularization term. This method, which is sometimes referred to in the literature as a proximal Newton…

Optimization and Control · Mathematics 2013-09-16 Richard H. Byrd , Jorge Nocedal , Figen Oztoprak

This paper investigates the box-constrained $\ell_0$-regularized sparse optimization problem. We introduce the concept of a $\tau$-stationary point and establish its connection to the local and global minima of the box-constrained…

Optimization and Control · Mathematics 2025-05-26 Yuge Ye , Qingna Li

In this paper, we present a dynamic non-diagonal regularization for interior point methods. The non-diagonal aspect of this regularization is implicit, since all the off-diagonal elements of the regularization matrices are cancelled out by…

Optimization and Control · Mathematics 2019-02-19 Spyridon Pougkakiotis , Jacek Gondzio

We propose and analyze a perturbative regularization method to approximate quadratic optimization problems with finite-dimensional degeneracy. The original problem is first approximated by a regularized problem depending on a small positive…

Numerical Analysis · Mathematics 2026-03-16 C. G. Gebhardt , I. Romero

We consider here a cell-centered finite difference approximation of the Richards equation in three dimensions, averaging for interface values the hydraulic conductivity $K=K(p)$, a highly nonlinear function, by arithmetic, upstream, and…

Numerical Analysis · Mathematics 2022-07-18 Daniele Bertaccini , Pasqua D'Ambra , Fabio Durastante , Salvatore Filippone

We present a numerical method for approximating the solutions of degenerate parabolic equations with a formal gradient flow structure. The numerical method we propose preserves at the discrete level the formal gradient flow structure,…

Analysis of PDEs · Mathematics 2016-02-11 Clément Cancès , Cindy Guichard

This paper concerns developing a numerical method of the Newton type to solve systems of nonlinear equations described by nonsmooth continuous functions. We propose and justify a new generalized Newton algorithm based on graphical…

Optimization and Control · Mathematics 2010-09-03 T. Hoheisel , C. Kanzow , B. S. Mordukhovich , H. Phan

In this paper we investigate adaptive discretization of the iteratively regularized Gauss- Newton method IRGNM. All-at-once formulations considering the PDE and the measurement equation simultaneously allow to avoid (approximate) solution…

Numerical Analysis · Mathematics 2018-08-20 Barbara Kaltenbacher , Alana Kirchner , Boris Vexler

When solving rank-deficient or discrete ill-posed problems by regularization methods, the choice of the regularization parameter is crucial. It is also of interest, the regularization norm used in the selection of the solution. In this…

Numerical Analysis · Mathematics 2024-10-30 Ibrahima Dione

We describe inexact proximal Newton-like methods for solving degenerate regularized optimization problems and for the broader problem of finding a zero of a generalized equation that is the sum of a continuous map and a maximal monotone…

Optimization and Control · Mathematics 2026-02-12 Ching-pei Lee , Stephen J. Wright

Strain localization and resulting plasticity and failure play an important role in the evolution of the lithosphere. These phenomena are commonly modeled by Stokes flows with viscoplastic rheologies. The nonlinearities of these rheologies…

Numerical Analysis · Mathematics 2020-10-28 Johann Rudi , Yu-hsuan Shih , Georg Stadler

We present first-order nonconforming Crouzeix-Raviart discretizations for the nonlinear generalized Stokes equations with $(r,\epsilon)$-structure. Thereby the velocity-errors are independent of the pressure-error; i.e., the method is…

Numerical Analysis · Mathematics 2025-01-28 Lars Diening , Adrian Hirn , Christian Kreuzer , Pietro Zanotti

When studying the multilinear PageRank problem, a system of polynomial equations needs to be solved. In this paper, we develop convergence theory for a modified Newton method in a particular parameter regime. The sequence of vectors…

Numerical Analysis · Mathematics 2017-01-23 Pei-Chang Guo

By viewing the operations of the Richardson purification algorithm as a discrete time dynamical process, we propose a method to overcome the instability of the algorithm by controlling chaos. We present theoretical analysis and numerical…

cmp-lg · Computer Science 2009-10-28 Song He

In a Hilbert space setting, we study the stability properties of the regularized continuous Newton method with two potentials, which aims at solving inclusions governed by structured monotone operators. The Levenberg-Marquardt…

Optimization and Control · Mathematics 2024-10-25 Boushra Abbas

This paper proposes two algorithms to impose seepage boundary conditions in the context of Richards' equation for groundwater flows in unsaturated media. Seepage conditions are non-linear boundary conditions, that can be formulated as a set…

We use Newton's method to find all roots of several polynomials in one complex variable of degree up to and exceeding one million and show that the method, applied to appropriately chosen starting points, can be turned into an algorithm…

Numerical Analysis · Mathematics 2017-09-13 Dierk Schleicher , Robin Stoll