Pages that link to "Item:Q1876588"
From MaRDI portal
The following pages link to Regularized Newton methods for convex minimization problems with singular solutions (Q1876588):
Displayed 29 items.
- Convergence analysis of a regularized interior point algorithm for the barrier problems with singular solutions (Q393377) (← links)
- An inexact proximal regularization method for unconstrained optimization (Q522090) (← links)
- Convergence properties of the regularized Newton method for the unconstrained nonconvex optimization (Q708864) (← links)
- A regularized Newton method without line search for unconstrained optimization (Q742310) (← links)
- Truncated regularized Newton method for convex minimizations (Q842780) (← links)
- On the convergence of an inexact Newton-type method (Q867927) (← links)
- Trust-region quadratic methods for nonlinear systems of mixed equalities and inequalities (Q1012237) (← links)
- A positive spectral gradient-like method for large-scale nonlinear monotone equations (Q1653975) (← links)
- A family of inexact SQA methods for non-smooth convex minimization with provable convergence guarantees based on the Luo-Tseng error bound property (Q1739040) (← links)
- Superlinear convergence of a Newton-type algorithm for monotone equations (Q1781869) (← links)
- A new regularized quasi-Newton method for unconstrained optimization (Q1800450) (← links)
- A regularized Newton method for degenerate unconstrained optimization problems (Q1926636) (← links)
- Adjoint-based exact Hessian computation (Q2026361) (← links)
- Local convergence analysis of a primal-dual method for bound-constrained optimization without SOSC (Q2032022) (← links)
- Two nonmonotone trust region algorithms based on an improved Newton method (Q2053070) (← links)
- A two-step improved Newton method to solve convex unconstrained optimization problems (Q2053267) (← links)
- Efficient regularized Newton-type algorithm for solving convex optimization problem (Q2089188) (← links)
- Local convergence analysis of the Levenberg-Marquardt framework for nonzero-residue nonlinear least-squares problems under an error bound condition (Q2278898) (← links)
- Self-adaptive inexact proximal point methods (Q2479838) (← links)
- A trust region method for optimization problem with singular solutions (Q2480784) (← links)
- On the Quadratic Convergence of the Cubic Regularization Method under a Local Error Bound Condition (Q4634142) (← links)
- Correction of trust region method with a new modified Newton method (Q5030542) (← links)
- A regularized Newton method for monotone nonlinear equations and its application (Q5746687) (← links)
- A Bregman Forward-Backward Linesearch Algorithm for Nonconvex Composite Optimization: Superlinear Convergence to Nonisolated Local Minima (Q5853567) (← links)
- Regularization of limited memory quasi-Newton methods for large-scale nonconvex minimization (Q6095733) (← links)
- Newton-MR: inexact Newton method with minimum residual sub-problem solver (Q6114941) (← links)
- Regularized Newton Method with Global \({\boldsymbol{\mathcal{O}(1/{k}^2)}}\) Convergence (Q6116237) (← links)
- A Regularized Newton Method for \({\boldsymbol{\ell}}_{q}\) -Norm Composite Optimization Problems (Q6116248) (← links)
- Globally convergent coderivative-based generalized Newton methods in nonsmooth optimization (Q6126654) (← links)