Pages that link to "Item:Q3037163"
From MaRDI portal
The following pages link to Truncated-Newton algorithms for large-scale unconstrained optimization (Q3037163):
Displayed 50 items.
- Block truncated-Newton methods for parallel optimization (Q582212) (← links)
- On diagonally preconditioning the truncated Newton method for super-scale linearly constrained nonlinear prrogramming (Q800833) (← 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)
- On large scale nonlinear network optimization (Q908858) (← links)
- Assessing a search direction within a truncated Newton method (Q918871) (← 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)
- A class on nonmonotone stabilization methods in unconstrained optimization (Q2277146) (← links)
- Truncated partitioning group correction algorithms for large-scale sparse unconstrained optimi\-zation (Q2383749) (← links)
- A trust region method for solving the decentralized static output feedback design problem (Q2386794) (← links)
- Planar conjugate gradient algorithm for large-scale unconstrained optimization. II: Application (Q2569194) (← links)
- On optimizing a maximin nonlinear function subject to replicated quasi- arborescence-like constraints (Q3361814) (← links)
- Dynamic scaling based preconditioning for truncated Newton methods in large scale unconstrained optimization (Q3369520) (← links)
- Local properties of inexact methods for minimizing nonsmooth composite functions (Q3760305) (← links)
- Numerical techniques in nonparametric estimation† (Q3776387) (← links)
- Newton's method for solving parametric linear quadratic control problems (Q3788608) (← links)
- Avoiding Modified Matrix Factorizations in Newton-like Methods (Q3802526) (← links)
- Computational experience with globally convergent descent methods for large sparse systems of nonlinear equations<sup>∗</sup> (Q3839446) (← links)
- A discrete Newton algorithm for minimizing a function of many variables (Q3934149) (← links)
- (Q3978055) (← links)
- (Q4039213) (← links)
- Implicitly restarted projection algorithm for solving optimization problems (Q4508639) (← links)
- Conjugate gradient (CG)-type method for the solution of Newton's equation within optimization frameworks (Q4657813) (← links)
- A derivative-based algorithm for a particular class of mixed variable optimization problems (Q4657820) (← links)
- The trust region subproblem and semidefinite programming* (Q4673323) (← links)
- A More Lenient Stopping Rule for Line Search Algorithms (Q4709751) (← links)