Pages that link to "Item:Q3037163"
From MaRDI portal
The following pages link to Truncated-Newton algorithms for large-scale unconstrained optimization (Q3037163):
Displaying 50 items.
- Efficient tridiagonal preconditioner for the matrix-free truncated Newton method (Q272460) (← links)
- Preconditioning Newton-Krylov methods in nonconvex large scale optimization (Q377728) (← links)
- Weaker Kantorovich type criteria for inexact Newton methods (Q390452) (← links)
- A matrix-free approach to build band preconditioners for large-scale bound-constrained optimization (Q396257) (← links)
- Inexact smoothing method for large scale minimax optimization (Q425468) (← links)
- Inexact trust region PGC method for large sparse unconstrained optimization (Q429517) (← links)
- On diagonally structured problems in unconstrained optimization using an inexact super Halley method (Q432797) (← links)
- A new hybrid classical-quantum algorithm for continuous global optimization problems (Q486403) (← links)
- Adaptive cubic regularisation methods for unconstrained optimization. I: Motivation, convergence and numerical results (Q535013) (← links)
- Convergence analysis of truncated incomplete Hessian Newton minimization method and application in biomolecular potential energy minimization (Q535293) (← links)
- Block truncated-Newton methods for parallel optimization (Q582212) (← links)
- A choice of forcing terms in inexact Newton iterations with application to pseudo-transient continuation for incompressible fluid flow computations (Q669414) (← links)
- Local path-following property of inexact interior methods in nonlinear programming (Q694602) (← links)
- An algorithm for nonlinear optimization problems with binary variables (Q711384) (← links)
- A nonmonotone truncated Newton-Krylov method exploiting negative curvature directions, for large scale unconstrained optimization (Q732778) (← links)
- An automatic regularization parameter selection algorithm in the total variation model for image deblurring (Q742848) (← links)
- On diagonally preconditioning the truncated Newton method for super-scale linearly constrained nonlinear prrogramming (Q800833) (← links)
- Truncated regularized Newton method for convex minimizations (Q842780) (← links)
- A truncated nonmonotone Gauss-Newton method for large-scale nonlinear least-squares problems (Q853562) (← links)
- A choice of forcing terms in inexact Newton method (Q859863) (← links)
- A new regularized limited memory BFGS-type method based on modified secant conditions for unconstrained optimization problems (Q897051) (← links)
- On large scale nonlinear network optimization (Q908858) (← links)
- Assessing a search direction within a truncated Newton method (Q918871) (← links)
- A limited memory BFGS-type method for large-scale unconstrained optimization (Q1004767) (← links)
- Performance evaluation of independent superbasic sets on nonlinear replicated networks (Q1068689) (← links)
- Numerical experience with the truncated Newton method for unconstrained optimization (Q1090623) (← links)
- A truncated Newton method with non-monotone line search for unconstrained optimization (Q1095799) (← links)
- Truncated Newton method for sparse unconstrained optimization using automatic differentiation (Q1095800) (← links)
- Numerical comparisons of nonlinear programming algorithms on serial and vector processors using automatic differentiation (Q1116896) (← links)
- Implementing proximal point methods for linear programming (Q1123124) (← links)
- Preconditioned Newton methods using incremental unknowns methods for the resolution of a steady-state Navier-Stokes-like problem (Q1126615) (← links)
- A successive quadratic programming method for a class of constrained nonsmooth optimization problems (Q1174457) (← links)
- Successive linearization methods for large-scale nonlinear programming problems (Q1185122) (← links)
- Tracing post-limit-point paths with incomplete or without factorization of the stiffness matrix (Q1190441) (← links)
- An interior point method for quadratic programs based on conjugate projected gradients (Q1260618) (← links)
- An implementation of linear and nonlinear multicommodity network flows (Q1268228) (← links)
- Inexact generalized Newton methods for second order \(C\)-differentiable optimization (Q1298488) (← links)
- A sequential quadratic programming-based algorithm for the optimization of gas networks (Q1314761) (← links)
- Superlinear convergence theorems for Newton-type methods for nonlinear systems of equations (Q1321180) (← links)
- An unconstrained optimization technique for large-scale linearly constrained convex minimization problems (Q1337633) (← links)
- Perturbed steepest-descent technique in multiextremal problems (Q1359471) (← links)
- Truncated Newton methods for optimization with inaccurate functions and gradients (Q1411387) (← links)
- Truncated-Newton training algorithm for neurocomputational viscoplastic model. (Q1418239) (← links)
- Variable metric methods for unconstrained optimization and nonlinear least squares (Q1593813) (← links)
- Nonmonotone curvilinear line search methods for unconstrained optimization (Q1816399) (← links)
- An algorithm for solving sparse nonlinear least squares problems (Q1822462) (← links)
- A quasi-discrete Newton algorithm with a nonmonotone stabilization technique (Q1823152) (← links)
- An H-form variant of the partitioned QN method (Q1873167) (← links)
- A truncated Newton optimization algorithm in meteorology applications with analytic Hessian/vector products (Q1892597) (← links)
- An active set feasible method for large-scale minimization problems with bound constraints (Q1928749) (← links)
