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)- An affine scaling optimal path method with interior backtracking curvilinear technique for linear constrained optimization
- Distance-based discriminant analysis method and its applications
- Trust-region quadratic methods for nonlinear systems of mixed equalities and inequalities
- On Lagrange multipliers of trust-region subproblems
- New optimality conditions for quadratic optimization problems with binary constraints
- BFGS trust-region method for symmetric nonlinear equations
- 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
- Convexity properties associated with nonconvex quadratic matrix functions and applications to quadratic programming
- Sequential quadratically constrained quadratic programming norm-relaxed algorithm of strongly sub-feasible directions
- A new predictor-corrector method for solving unconstrained minimization problems
- Approximate solution of the trust region problem by minimization over two-dimensional subspaces
- Parallel quasi-Newton methods for unconstrained optimization
- A constrained eigenvalue problem
- Algorithms for bound constrained quadratic programming problems
- A hybrid method for the nonlinear least squares problem with simple bounds
- An interior point algorithm to solve computationally difficult set covering problems
- Computing a Celis-Dennis-Tapia trust-region step for equality constrained optimization
- Nonmonotone trust region methods with curvilinear path in unconstrained optimization
- Computation of a trust region step
- A quasi-Gauss-Newton method for solving nonlinear algebraic equations
- A generalized quadratic programming-based phase I--phase II method for inequality-constrained optimization
- Duallity and sensitivity in nonconvex quadratic optimization over an ellipsoid
- A framework for globally convergent algorithms using gradient bounding functions
- Tensor methods for large sparse systems of nonlinear equations
- Advances in trust region algorithms for constrained optimization
- Scaled optimal path trust-region algorithm
- A model trust-region modification of Newton's method for nonlinear two- point boundary-value problems
- Local minima of the trust region problem
- On the solution of a two ball trust region subproblem
- On piecewise quadratic Newton and trust region problems
- A nonsmooth inexact Newton method for the solution of large-scale nonlinear complementarity 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
- Trust region affine scaling algorithms for linearly constrained convex and concave programs
- Solving large-scale constrained least-squares problems.
- A new affine scaling interior point algorithm for nonlinear optimization subject to linear equality and inequality constraints.
- Robustness of trajectories with finite time extent
- Numerical analysis of bump solutions for neural field equations with periodic microstructure
- SOCP reformulation for the generalized trust region subproblem via a canonical form of two symmetric matrices
- A globally convergent method for nonlinear least-squares problems based on the Gauss-Newton model with spectral correction
- Convergence analysis of an SVD-based algorithm for the best rank-1 tensor approximation
- An efficient algorithm for solving the generalized trust region subproblem
- New zero-finders for trust-region computations
- A branch and bound algorithm for nonconvex quadratic optimization with ball and linear constraints
- A linear-time algorithm for the trust region subproblem based on hidden convexity
- Eigenvalue-based algorithm and analysis for nonconvex QCQP with one constraint
- A note on robust descent in differentiable optimization
- On an elliptical trust-region procedure for ill-posed nonlinear least-squares problems
- Efficient solution of quadratically constrained quadratic subproblems within the mesh adaptive direct search algorithm
- Generalized indirect inference for discrete choice models
- Optimal error correction and methods of feasible directions
- A Jacobian smoothing method for box constrained variational inequality problems
- A geometric analysis of phase retrieval
- Distributed Gauss-Newton optimization method for history matching problems with multiple best matches
- A new regularized quasi-Newton method for unconstrained optimization
- An efficient trust region method for unconstrained discrete-time optimal control problems
- Optimization of dual response systems: A comprehensive procedure for degenerate and nondegenerate problems
- Nonmonotonic back-tracking trust region interior point algorithm for linear constrained optimization
- An affine scaling trust-region approach to bound-constrained nonlinear systems
- Global Newton-type methods and semismooth reformulations for NCP
- An interior method for nonconvex semidefinite programs
- Nonmonotone trust region method for solving optimization problems
- A trust-region strategy for minimization on arbitrary domains
- Variational analysis of an extended eigenvalue problem
- Identification of parameters in polymer crystallization
- A projection technique for partitioning the nodes of a graph
- A recipe for semidefinite relaxation for \((0,1)\)-quadratic programming
- Hybrid methods for large sparse nonlinear least squares
- Geometric notes on optimization with equality constraints
- Convergence of Pham Dinh-Le Thi's algorithm for the trust-region subproblem
- On the convergence of an inexact Gauss-Newton trust-region method for nonlinear least-squares problems with simple bounds
- A trust region affine scaling method for bound constrained optimization
- GQTPAR
- Mining adversarial patterns via regularized loss minimization
- A reduced-space line-search method for unconstrained optimization via random descent directions
- A trust region approach for numerical modeling of non-isothermal phase change
- Globalized inexact proximal Newton-type methods for nonconvex composite functions
- An extended Newton-type algorithm for \(\ell_2\)-regularized sparse logistic regression and its efficiency for classifying large-scale datasets
- Subspace quadratic regularization method for group sparse multinomial logistic regression
- On the optimal correction of infeasible systems of linear inequalities
- An approach for robust PDE-constrained optimization with application to shape optimization of electrical engines and of dynamic elastic structures under uncertainty
- On the local convergence of a stochastic semismooth Newton method for nonsmooth nonconvex optimization
- Distributed quasi-Newton derivative-free optimization method for optimization problems with multiple local optima
- Convergence properties of monotone and nonmonotone proximal gradient methods revisited
- On local nonglobal minimum of trust-region subproblem and extension
- Maximizing sum of coupled traces with applications
- A latent variable mixed-effects location scale model with an application to daily diary data
- Gradient projection Newton algorithm for sparse collaborative learning using synthetic and real datasets of applications
- An efficient PGM-based algorithm with backtracking strategy for solving quadratic optimization problems with spherical constraint
- Low-rank approximation to entangled multipartite quantum systems
- Rank-1 approximation for entangled multipartite real systems
- \(\rho\)-regularization subproblems: strong duality and an eigensolver-based algorithm
- The generalized trust region subproblem: solution complexity and convex hull results
- A self-consistent-field iteration for MAXBET with an application to multi-view feature extraction
- A regularized limited memory BFGS method for large-scale unconstrained optimization and its efficient implementations
- A new nonmonotone adaptive trust region algorithm.
- On the branch and bound algorithm for the extended trust-region subproblem
- Gradient projection Newton pursuit for sparsity constrained optimization
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)
