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; zbMATH DE number 4133416
- 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)
- 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
- 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
- How to convexify the intersection of a second order cone and a nonconvex quadratic
- An interior point algorithm to solve computationally difficult set covering problems
- On solving trust-region and other regularised subproblems in optimization
- Computation of sparse low degree interpolating polynomials and their application to derivative-free optimization
- GQTPAR
- A constrained eigenvalue problem
- Algorithms for the solution of quadratic knapsack problems
- A trust region affine scaling method for bound constrained optimization
- The trust region subproblem and semidefinite programming*
- On the generalized discrepancy principle for Tikhonov regularization in Hilbert scales
- Nonconvex quadratically constrained quadratic programming: Best D.C. Decompositions and their SDP representations
- Regularization using a parameterized trust region subproblem
- Global Newton-type methods and semismooth reformulations for NCP
- Two globally convergent nonmonotone trust-region methods for unconstrained optimization
- Minimization methods for smooth nonconvex functions
- CONDOR, a new parallel, constrained extension of Powell's UOBYQA algorithm: Experimental results and comparison with the DFO algorithm
- On the minimization over sparse symmetric sets: projections, optimality conditions, and algorithms
- Nonmonotonic back-tracking trust region interior point algorithm for linear constrained optimization
- The trust region subproblem with non-intersecting linear constraints
- A variant of trust-region methods for unconstrained optimization
- MANPAK: A set of algorithms for computations on implicitly defined manifolds
- A subspace implementation of quasi-Newton trust region methods for unconstrained optimization
- Norm-constrained least-squares solutions to the matrix equation \(A X B = C\)
- On the convergence of an inexact Gauss-Newton trust-region method for nonlinear least-squares problems with simple bounds
- A globalized Newton method for the computation of normalized Nash equilibria
- Iterative methods for finding a trust-region step
- A direct active set algorithm for large sparse quadratic programs with simple bounds
- A smoothing Levenberg-Marquardt algorithm for semi-infinite programming
- On a semismooth least squares formulation of complementarity problems with gap reduction
- An interior method for nonconvex semidefinite programs
- Robustness of trajectories with finite time extent
- A new minimization protocol for solving nonlinear Poisson-Boltzmann mortar finite element equation
- Projected Tikhonov regularization of large-scale discrete ill-posed problems
- Low-rank approximation to entangled multipartite quantum systems
- An affine scaling trust-region algorithm with interior backtracking technique for solving bound-constrained nonlinear systems
- Efficient block-coordinate descent algorithms for the group Lasso
- A new trust region technique for the maximum weight clique problem
- Inexact smoothing method for large scale minimax optimization
- Inexact trust region PGC method for large sparse unconstrained optimization
- A recipe for semidefinite relaxation for \((0,1)\)-quadratic programming
- Algorithm 943: MSS: MATLAB software for L-BFGS trust-region subproblems for large-scale optimization
- \texttt{trlib}: a vector-free implementation of the GLTR method for iterative solution of the trust region problem
- Optimal prediction pools
- 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
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)
