Computing a Trust Region Step
From MaRDI portal
Publication:3343340
DOI10.1137/0904038zbMATH Open0551.65042OpenAlexW2075184363MaRDI QIDQ3343340FDOQ3343340
Authors: Jorge J. Moré, Danny C. Sorensen
Publication date: 1983
Published in: SIAM Journal on Scientific and Statistical Computing (Search for Journal in Brave)
Full work available at URL: https://digital.library.unt.edu/ark:/67531/metadc283525/
Recommendations
- Computation of a trust region step
- scientific article
- Computing a Trust Region Step for a Penalty Function
- Iterative methods for finding a trust-region step
- Trust Region Methods
- scientific article; zbMATH DE number 1183048
- Trust Region Algorithms and Timestep Selection
- scientific article; zbMATH DE number 2069282
- Gauss quadrature applied to trust region computations
- Some extensions of the trust region method
Cited In (only showing first 100 items - show all)
- Global Convergence of a Trust Region Algorithm for Nonlinear Inequality Constrained Optimization Problems
- A new regularized quasi-Newton method for unconstrained optimization
- Solving Large-Scale Cubic Regularization by a Generalized Eigenvalue Problem
- Title not available (Why is that?)
- Inexact successive quadratic approximation for regularized optimization
- Computing a Trust Region Step for a Penalty Function
- Convergence of Affine-Scaling Interior-Point Methods with Line Search for Box Constrained Optimization
- A Newton-like method with mixed factorizations and cubic regularization for unconstrained minimization
- A branch and bound algorithm for nonconvex quadratic optimization with ball and linear constraints
- Variational analysis of an extended eigenvalue problem
- Efficient solution of quadratically constrained quadratic subproblems within the mesh adaptive direct search algorithm
- Manifold sampling for optimization of nonconvex functions that are piecewise linear compositions of smooth components
- Convergence to a second-order point of a trust-region algorithm with a nonmonotonic penalty parameter for constrained optimization
- Advances in trust region algorithms for constrained optimization
- On local non-global minimizers of quadratic optimization problem with a single quadratic constraint
- Convergence of a projected gradient method with trust region for nonlinear constrained optimization†
- A modified nearly exact method for solving low-rank trust region subproblem
- Distance-based discriminant analysis method and its applications
- Entropy Satisfying Schemes for Computing Selection Dynamics in Competitive Interactions
- Encrypted quantum state tomography with phase estimation for quantum Internet
- Simultaneous diagonalization of matrices and its applications in quadratically constrained quadratic programming
- Separable cubic modeling and a trust-region strategy for unconstrained minimization with impact in global optimization
- A fast algorithm for globally solving Tikhonov regularized total least squares problem
- Title not available (Why is that?)
- A class of collinear scaling algorithms for bound-constrained optimization: Derivation and computational results
- Optimization of dual response systems: A comprehensive procedure for degenerate and nondegenerate problems
- A retrospective trust-region method for unconstrained optimization
- Computing a Celis-Dennis-Tapia trust-region step for equality constrained optimization
- Solving nonlinear systems of equations by means of quasi-neston methods with a nonmonotone stratgy∗
- An improved trust region method for unconstrained optimization
- Newton-Krylov type algorithm for solving nonlinear least squares problems
- A restricted trust region algorithm for unconstrained optimization
- Block relaxation and majorization methods for the nearest correlation matrix with factor structure
- Parameterized eigensolution technique for solving constrained least squares problems∗
- On piecewise quadratic Newton and trust region problems
- A hybrid method for the nonlinear least squares problem with simple bounds
- A regularized limited memory BFGS method for large-scale unconstrained optimization and its efficient implementations
- Un Algorithme pour la Bipartition d'un Graphe en Sous-graphes de Cardinalité Fixée
- A global Jacobian smoothing algorithm for nonlinear complementarity problems
- Stochastic regularized Newton methods for nonlinear equations
- Computation of a trust region step
- On the solution of a two ball trust region subproblem
- An augmented Lagrangian trust region method for equality constrained optimization
- On solving \(L_{q}\)-penalized regressions
- A class of collinear scaling algorithms for bound-constrained optimization: convergence theorems
- Interior-point algorithms for global optimization
- A trust-region method applied to parameter identification of a simple prey-predator model
- A proximal quasi-Newton trust-region method for nonsmooth regularized optimization
- Globally solving the trust region subproblem using simple first-order methods
- A subspace version of the Wang-Yuan augmented Lagrangian-trust region method for equality constrained optimization
- Derivative-free optimization methods
- A new predictor-corrector method for solving unconstrained minimization problems
- A Lanczos Method for Large-Scale Extreme Lorentz Eigenvalue Problems
- Methods of minimization of functions on a sphere and their applications
- Approximate solution of the trust region problem by minimization over two-dimensional subspaces
- A multiplier active-set trust-region algorithm for solving constrained optimization problem
- The generalized trust region subproblem
- Strong duality for generalized trust region subproblem: S-lemma with interval bounds
- A new active-set strategy for NCP with degenerate solutions
- A latent variable mixed-effects location scale model with an application to daily diary data
- Sequential quadratically constrained quadratic programming norm-relaxed algorithm of strongly sub-feasible directions
- Duality and solutions for quadratic programming over single non-homogeneous quadratic constraint
- An algorithm for solving new trust region subproblem with conic model
- A mathematical biography of Danny C. Sorensen
- Limited-memory BFGS systems with diagonal updates
- An efficient trust region method for unconstrained discrete-time optimal control problems
- BFGS trust-region method for symmetric nonlinear equations
- Convergence rate of the trust region method for nonlinear equations under local error bound condition
- Sensitivity of trust-region algorithms to their parameters
- An Ellipsoidal Branch and Bound Algorithm for Global Optimization
- Convergence of Pham Dinh-Le Thi's algorithm for the trust-region subproblem
- On the convexity of a class of quadratic mappings and its application to the problem of finding the smallest ball enclosing a given intersection of balls
- New optimality conditions for quadratic optimization problems with binary constraints
- Tensor methods for large sparse systems of nonlinear equations
- Nonmonotone trust region methods with curvilinear path in unconstrained optimization
- Convergence properties of trust region methods for linear and convex constraints
- On a subproblem of trust region algorithms for constrained optimization
- Trust-region quadratic methods for nonlinear systems of mixed equalities and inequalities
- A new zero-finder for Tikhonov regularization
- A dual-weighted trust-region adaptive POD 4D-VAR applied to a finite-element shallow-water equations model
- Approximately-isometric diffusion maps
- Algorithms for bound constrained quadratic programming problems
- Globally and superlinearly convergent QP-free algorithm for nonlinear constrained optimization
- Iterative computation of negative curvature directions in large scale optimization
- Convexity properties associated with nonconvex quadratic matrix functions and applications to quadratic programming
- An alternating variable method for the maximal correlation problem
- A linear-time algorithm for trust region problems
- A quasi-Gauss-Newton method for solving nonlinear algebraic equations
- A nonmonotone filter method for nonlinear optimization
- Variable-number sample-path optimization
- A new smoothing Newton-type algorithm for semi-infinite programming
- A nonsmooth inexact Newton method for the solution of large-scale nonlinear complementarity problems
- On an elliptical trust-region procedure for ill-posed nonlinear least-squares problems
- Convex optimization approach to a single quadratically constrained quadratic minimization problem
- Projected quasi-Newton algorithm with trust region for constrained optimization
- A model-hybrid approach for unconstrained optimization problems
- A generalized quadratic programming-based phase I--phase II method for inequality-constrained optimization
- On efficiently computing the eigenvalues of limited-memory quasi-Newton matrices
- Nonmonotone trust region method for solving optimization problems
- Practical active-set Euclidian trust-region method with spectral projected gradients for bound-constrained minimization
Uses Software
This page was built for publication: Computing a Trust Region Step
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3343340)