Approximate solution of the trust region problem by minimization over two-dimensional subspaces
From MaRDI portal
DOI10.1007/BF01580735zbMATH Open0652.90082OpenAlexW2119842211MaRDI QIDQ1107449FDOQ1107449
Authors: Robert B. Schnabel, Gerald A. Shultz, R. H. Byrd 
Publication date: 1988
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01580735
Recommendations
Numerical mathematical programming methods (65K05) Convex programming (90C25) Methods of successive quadratic programming type (90C55)
Cites Work
- Computing a Trust Region Step
- Testing Unconstrained Optimization Software
- Tensor Methods for Nonlinear Equations
- A New Algorithm for Unconstrained Optimization
- A More Portable Fortran Random Number Generator
- Computing Optimal Locally Constrained Steps
- Title not available (Why is that?)
- Newton’s Method with a Model Trust Region Modification
- Two new unconstrained optimization algorithms which use function and gradient values
- A Family of Trust-Region-Based Algorithms for Unconstrained Minimization with Strong Global Convergence Properties
- Title not available (Why is that?)
- A modular system of algorithms for unconstrained minimization
Cited In (55)
- Volatility is (mostly) path-dependent
- Simulation‐supported characterization of 3D‐printed biodegradable structures
- An \(LDL^{\mathrm{T}}\) trust-region quasi-Newton method
- A class of nonmonotone trust region algorithms for unconstrained optimization problems
- A practical method for solving large-scale TRS
- A Subspace Minimization Method for the Trust-Region Step
- Combining and scaling descent and negative curvature directions
- Exploiting Hessian matrix and trust-region algorithm in hyperparameters estimation of Gaussian process
- Mining adversarial patterns via regularized loss minimization
- Value functions and error bounds of trust region methods
- Secant algorithms with nonmonotone trust region that employs fletcher penalty function for constrained optimization
- A conic trust-region method and its convergence properties
- Training multi-layered neural network with a trust-region based algorithm
- On efficiently combining limited-memory and trust-region techniques
- A unified approach to global convergence of trust region methods for nonsmooth optimization
- A new simple model trust-region method with generalized Barzilai-Borwein parameter for large-scale optimization
- An energy error-based method for the resolution of the Cauchy problem in 3D linear elasticity
- A model-hybrid approach for unconstrained optimization problems
- Two error bounds for constrained optimization problems and their applications
- A block Lanczos method for the extended trust-region subproblem
- Numerical approximation of partial differential equations by a variable projection method with artificial neural networks
- Nonconvex optimization using negative curvature within a modified linesearch
- The convergence of the generalized Lanczos trust-region method for the trust-region subproblem
- Using improved directions of negative curvature for the solution of bound-constrained nonconvex problems
- Similarity transformation parameters recovery based on Radon transform. application in image registration and object recognition
- A method for computing inverse parametric PDE problems with random-weight neural networks
- On the ill-posedness of the trust region subproblem
- Scaled optimal path trust-region algorithm
- A variant of trust-region methods for unconstrained optimization
- A subspace implementation of quasi-Newton trust region methods for unconstrained optimization
- Roots of bivariate polynomial systems via determinantal representations
- Dogleg paths and trust region methods with back tracking technique for unconstrained optimization
- Numerical computation of partial differential equations by hidden-layer concatenated extreme learning machine
- Constrained optimization for liquid crystal equilibria
- A robust combined trust region–line search exact penalty projected structured scheme for constrained nonlinear least squares
- Globalization strategies for Newton-Krylov methods for stabilized FEM discretization of Navier-Stokes equations
- Title not available (Why is that?)
- An interior method for nonconvex semidefinite programs
- Computation of a trust region step
- A meshless method for the nonlinear von Kármán plate with multiple folds of complex shape. A bridge between cracks and folds
- An open-source unconstrained stress updating algorithm for the modified Cam-clay model
- Optimal convective heat transfer in double pipe with parabolic fins
- A new minimization protocol for solving nonlinear Poisson-Boltzmann mortar finite element equation
- A new type of condensation curvilinear path algorithm for unconstrained generalized geometric programming
- A comparison of methods for traversing regions of non-convexity in optimization problems
- An augmented Lagrangian trust region method for equality constrained optimization
- Full waveform inversion through double-sweeping solver
- On fluorophore imaging by diffusion equation model: decompositions and optimizations
- On the convergence of interior-reflective Newton methods for nonlinear minimization subject to bounds
- An optimization approach for the Cauchy problem in linear elasticity
- A lower-bound formulation for the geometry and topology optimization of truss structures under multiple loading
- A Riemannian subspace limited-memory SR1 trust region method
- Trust-region methods for nonlinear elliptic equations with radial basis functions
- Contact between rigid convex NURBS particles based on computer graphics concepts
- Exact line and plane search for tensor optimization
Uses Software
This page was built for publication: Approximate solution of the trust region problem by minimization over two-dimensional subspaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1107449)
