Newton’s Method with a Model Trust Region Modification
From MaRDI portal
Cited in
(only showing first 100 items - show all)- An affine scaling optimal path method with interior backtracking curvilinear technique for linear constrained optimization
- A class of collinear scaling algorithms for bound-constrained optimization: Derivation and computational results
- Nonmonotonic reduced projected Hessian method via an affine scaling interior modified gradient path for bounded-constrained optimization
- Newton-Krylov type algorithm for solving nonlinear least squares problems
- A new predictor-corrector method for solving unconstrained minimization problems
- Solving large nonlinear systems of equations by an adaptive condensation process
- Approximate solution of the trust region problem by minimization over two-dimensional subspaces
- Computing a Celis-Dennis-Tapia trust-region step for equality constrained optimization
- Nonmonotone trust region methods with curvilinear path in unconstrained optimization
- On affine scaling algorithms for nonconvex quadratic programming
- Generalization of Karmarkar's algorithm to convex homogeneous functions
- Computation of a trust region step
- Duallity and sensitivity in nonconvex quadratic optimization over an ellipsoid
- A framework for globally convergent algorithms using gradient bounding functions
- Scaled optimal path trust-region algorithm
- On the updating scheme in a class of collinear scaling algorithms for sparse minimization
- A model trust-region modification of Newton's method for nonlinear two- point boundary-value problems
- Nonmonotonic trust region algorithm
- A new trust region algorithm for bound constrained minimization
- A class of nonmonotone stabilization trust region methods
- On the convergence of interior-reflective Newton methods for nonlinear minimization subject to bounds
- On piecewise quadratic Newton and trust region problems
- Convergence to a second-order point of a trust-region algorithm with a nonmonotonic penalty parameter for constrained optimization
- Difference of convex functions optimization algorithms (DCA) for globally minimizing nonconvex quadratic forms on Euclidean balls and spheres
- Potential reduction algorithms for structured combinatorial optimization problems
- A potential reduction approach to the frequency assignment problem
- On the complexity of approximating a KKT point of quadratic programming
- Numerical simulation of two- and three-dimensional complex flows of viscoelastic fluids using the stream-tube method
- Solving large-scale constrained least-squares problems.
- A new affine scaling interior point algorithm for nonlinear optimization subject to linear equality and inequality constraints.
- Quasi-Newton trust region algorithm for non-smooth least squares problems
- Convergence properties of improved secant methods with region multiplier
- Robustness of trajectories with finite time extent
- Assessing the effects of daily commuting in two-patch dengue dynamics: a case study of Cali, Colombia
- Cost-sensitive estimation of ARMA models for financial asset return data
- New zero-finders for trust-region computations
- A branch and bound algorithm for nonconvex quadratic optimization with ball and linear constraints
- A simple alternating direction method for the conic trust region subproblem
- A fractional trust region method for linear equality constrained optimization
- Robust viability analysis of a controlled epidemiological model
- Nonmonotonic back-tracking trust region interior point algorithm for linear constrained optimization
- A numerical study on large-scale nonlinear solvers
- A trust-region strategy for minimization on arbitrary domains
- Variational analysis of an extended eigenvalue problem
- A nonmonotone trust region method for unconstrained optimization problems on Riemannian manifolds
- An approach for robust PDE-constrained optimization with application to shape optimization of electrical engines and of dynamic elastic structures under uncertainty
- Error analysis for denoising smooth modulo signals on a graph
- On local nonglobal minimum of trust-region subproblem and extension
- An efficient PGM-based algorithm with backtracking strategy for solving quadratic optimization problems with spherical constraint
- On obtaining sparse semantic solutions for inverse problems, control, and neural network training
- Performance enhancement of Gauss-Newton trust-region solver for distributed Gauss-Newton optimization method
- Newton-type methods for non-convex optimization under inexact Hessian information
- A geometric characterization of strong duality in nonconvex quadratic programming with linear and nonconvex quadratic constraints
- A decoupled first/second-order steps technique for nonconvex nonlinear unconstrained optimization with improved complexity bounds
- Optimality condition and complexity analysis for linearly-constrained optimization without differentiability on the boundary
- Recent advances in trust region algorithms
- A class of collinear scaling algorithms for bound-constrained optimization: convergence theorems
- Second-order negative-curvature methods for box-constrained and general constrained optimization
- A trust region method for solving the decentralized static output feedback design problem
- The convergence of subspace trust region methods
- A modified trust region method with beale's PCG technique for optimization
- An affine scaling projective reduced Hessian algorithm for minimum optimization with nonlinear equality and linear inequality constraints
- An affine scaling interior trust-region method for \(LC^{1}\) minimization subject to bounds on variables
- A subspace implementation of quasi-Newton trust region methods for unconstrained optimization
- Globally and superlinearly convergent trust-region algorithm for convex \(SC^ 1\)-minimization problems and its application to stochastic programs
- An affine scaling trust-region algorithm with interior backtracking technique for solving bound-constrained nonlinear systems
- Affine scaling inexact generalized Newton algorithm with interior backtracking technique for solving bound-constrained semismooth equations
- Two globally convergent nonmonotone trust-region methods for unconstrained optimization
- A subspace version of the Wang-Yuan augmented Lagrangian-trust region method for equality constrained optimization
- Secant algorithms with nonmonotone trust region that employs fletcher penalty function for constrained optimization
- Backward step control for global Newton-type methods
- A notion of compliance robustness in topology optimization
- Computational methods for solving nonconvex block-separable constrained quadratic problems
- Approximate dynamic programming based on high dimensional model representation
- Cubic overestimation and secant updating for unconstrained optimization of \(C^{2,1}\) functions
- Parametric approach for correcting inconsistent linear equality system
- Canonical dual approach for minimizing a nonconvex quadratic function over a sphere
- Tractable Bayesian variable selection: beyond normality
- Stability of lagrangian duality for nonconvex quadratic programming. Solution methods and applications in computer vision
- Globally Convergent Algorithm for Solving Large Nonlinear Systems of Equations
- Complex nonlinear parameter estimation (CNPE) and obstacle shape reconstruction
- Computing quasisolutions of nonlinear inverse problems via efficient minimization of trust region problems
- Viable control of an epidemiological model
- Optimization of unconstrained functions with sparse hessian matrices-newton-type methods
- An adaptive conic trust-region method for unconstrained optimization
- Alternating minimization algorithm with automatic relevance determination for transmission tomography under Poisson noise
- Robust model-based stratification sampling designs
- Training multi-layered neural network with a trust-region based algorithm
- Optimization of unconstrained functions with sparse Hessian matrices—Quasi-Newton methods
- Methods of minimization of functions on a sphere and their applications
- Minimization methods for smooth nonconvex functions
- Nonconvex approximations in unconstrained minimization
- A mathematical biography of Danny C. Sorensen
- Limited-memory BFGS systems with diagonal updates
- On the ill-posedness of the trust region subproblem
- Computational schema on ridge analysis
- Implicitly restarted projection algorithm for solving optimization problems
- Parameterized eigensolution technique for solving constrained least squares problems∗
- Un Algorithme pour la Bipartition d'un Graphe en Sous-graphes de Cardinalité Fixée
- Globally solving the trust region subproblem using simple first-order methods
This page was built for publication: Newton’s Method with a Model Trust Region Modification
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3942322)