Computing a Trust Region Step
From MaRDI portal
Publication:3343340
DOI10.1137/0904038zbMath0551.65042MaRDI QIDQ3343340
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/
Related Items
Global convergence of SSM for minimizing a quadratic over a sphere, The trust region subproblem and semidefinite programming*, Global Convergence of a Trust Region Algorithm for Nonlinear Inequality Constrained Optimization Problems, A Modified Trust Region Algorithm, A trust region typed dogleg method for nonlinear optimization*, Convergence analysis of the Levenberg–Marquardt method, Projected filter trust region methods for a semismooth least squares formulation of mixed complementarity problems, Trust-region interior-point method for large sparsel1optimization, Practical active-set Euclidian trust-region method with spectral projected gradients for bound-constrained minimization, Matrix-free algorithm for the large-scale constrained trust-region subproblem, Hybrid Newton-type method for a class of semismooth equations, Convergence of a projected gradient method with trust region for nonlinear constrained optimization†, Solving nonlinear systems of equations by means of quasi-neston methods with a nonmonotone stratgy∗, 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, On a semismooth least squares formulation of complementarity problems with gap reduction, On the use of quadratic models in unconstrained minimization without derivatives, GQTPAR, CONDOR, a new parallel, constrained extension of Powell's UOBYQA algorithm: Experimental results and comparison with the DFO algorithm, A direct active set algorithm for large sparse quadratic programs with simple bounds, MANPAK: A set of algorithms for computations on implicitly defined manifolds, A continuous approach to inductive inference, An iterative method for solving semismooth equations, Globally and superlinearly convergent QP-free algorithm for nonlinear constrained optimization, An interior affine scaling projective algorithm for nonlinear equality and linear inequality constrained optimization, A restricted trust region algorithm for unconstrained optimization, Interior-point algorithms for global optimization, Algorithms for the solution of quadratic knapsack problems, Convergence rate of the trust region method for nonlinear equations under local error bound condition, A conic trust-region method for optimization with nonlinear equality and inequality constrains via active-set strategy, A modified nearly exact method for solving low-rank trust region subproblem, Projected quasi-Newton algorithm with trust region for constrained optimization, Convergence properties of trust region methods for linear and convex constraints, On a subproblem of trust region algorithms for constrained optimization, An algorithm for solving new trust region subproblem with conic model, On solving \(L_{q}\)-penalized regressions, 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, Regularization using a parameterized trust region subproblem, Variable-number sample-path optimization, A new zero-finder for Tikhonov regularization, An affine scaling optimal path method with interior backtracking curvilinear technique for linear constrained optimization, 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, 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, A Jacobian smoothing method for box constrained variational inequality problems, 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, A method of trust region type for minimizing noisy functions, A class of collinear scaling algorithms for bound-constrained optimization: convergence theorems, A modified trust region method with beale's PCG technique for optimization, A new trust region technique for the maximum weight clique problem, Iterative computation of negative curvature directions in large scale optimization, A trust-region method by active-set strategy for general nonlinear optimization, On the use of simplex methods in constructing quadratic models, A new minimization protocol for solving nonlinear Poisson-Boltzmann mortar finite element equation, An affine scaling projective reduced Hessian algorithm for minimum optimization with nonlinear equality and linear inequality constraints, A trust-region method applied to parameter identification of a simple prey-predator model, An affine scaling interior trust-region method for \(LC^{1}\) minimization subject to bounds on variables, Exploiting Hessian matrix and trust-region algorithm in hyperparameters estimation of Gaussian process, Robust optimal feedback for terminal linear-quadratic control problems under disturbances, Interior point projected reduced Hessian method with trust region strategy for nonlinear constrained optimization, A subspace implementation of quasi-Newton trust region methods for unconstrained optimization, A variant of trust-region methods for unconstrained optimization, An affine scaling trust-region algorithm with interior backtracking technique for solving bound-constrained nonlinear systems, Stability of lagrangian duality for nonconvex quadratic programming. Solution methods and applications in computer vision, An adaptive conic trust-region method for unconstrained optimization, Training multi-layered neural network with a trust-region based algorithm, A Meshless Technique Based on Integrated Radial Basis Function Networks for Elliptic Partial Differential Equations, Methods of minimization of functions on a sphere and their applications, Minimization methods for smooth nonconvex functions, Unnamed Item, Unnamed Item
Uses Software
