Trust Region Methods
constrained optimizationgradient methodnonlinear fittingoptimization techniquespenalty function methodssequential quadratic programming methodstextbooktrust-region methods
Research exposition (monographs, survey articles) pertaining to numerical analysis (65-02) Numerical mathematical programming methods (65K05) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Nonlinear programming (90C30) Methods of successive quadratic programming type (90C55)
This interesting and very complete book treats of trust-region methods for optimization. Recall quickly the definition of a basic trust-region. At each iterate \(x_k\), we first define a model \(m_k(x)\) whose purpose is to approximate the objective function within a suitable neighbourhood of \(x_k\), which we refer to as the trust region. The trust region is the set of points: \[ B_k= \{x\in \mathbb{R}^n/\|x- x_k\|\leq \Delta_k\}, \] where \(\Delta_k\) is the trust region radius. A trial point \(x_k+ s_k\) is next sought with the aim of reducing the model, while satisfying \(\|s_k\|\leq \Delta_k\). We ask that the reduction in the model at the trial point bears some relationship to the value \(\nabla_xf(x_k)\) and say that any step which achieves this gives a sufficient reduction of the model. The objective of these methods is to find a local solution of the problem \[ \underset{x\in \mathbb{R}^n} {\text{Minimize}} f(x). \] Having determined the trial step, the objective function is computed at \(x_k+ s_k\) and compared to the value predicted by the model at this point, that is \(m_k(x_k+ s_k)\). If the sufficient reduction predicted by the model is realized by the objective function at this point is realized by the objective function the trial point is accepted as the next iterate and the trust region is expanded or kept the same. The authors consider constrained and unconstrained optimization problems for smooth and nonsmooth functionals. The main tools in functional analysis are first recalled as well as the classical optimization methods such as the conjugate gradient method. The main chapters are: -- trust-region methods for unconstrained optimization; -- trust-region methods for constrained optimization with convex constraints; -- trust-region methods for general constrained optimization and systems of nonlinear equations (penalty function methods, sequential quadratic programming methods, nonlinear fitting). A very complete and annotated bibliography ends this passionating book. I only regret that global optimization methods are not described in this work. I warmly recommend this book to searchers and engineers confronted to concrete optimization problems.
- A hierarchical model for rate-dependent polycrystals
- Trust-region and other regularisations of linear least-squares problems
- Combining trust-region techniques and Rosenbrock methods to compute stationary points
- Two error bounds for constrained optimization problems and their applications
- A class of collinear scaling algorithms for bound-constrained optimization: Derivation and computational results
- Improving directions of negative curvature in an efficient manner
- Variable-fidelity optimization: efficiency and robustness
- A new trust region method with adaptive radius
- A conic trust-region method and its convergence properties
- A hybrid of the Newton-GMRES and electromagnetic meta-heuristic methods for solving systems of nonlinear equations
- Computation of a trust region step
- Gauss quadrature applied to trust region computations
- A trust-region-approach for solving a parameter estimation problem from the biotechnology area
- Combining trust region and linesearch algorithm for equality constrained optimization
- A Levenberg-Marquardt method for large nonlinear least-squares problems with dynamic accuracy in functions and gradients
- A progressive barrier derivative-free trust-region algorithm for constrained optimization
- Multivariate GARCH estimation via a Bregman-proximal trust-region method
- A hybrid of adjustable trust-region and nonmonotone algorithms for unconstrained optimization
- A new adaptive trust-region method for system of nonlinear equations
- On the global convergence of a projective trust region algorithm for nonlinear equality constrained optimization
- Concise complexity analyses for trust region methods
- A nonconvex formulation for low rank subspace clustering: algorithms and convergence analysis
- A second-order optimality condition with first- and second-order complementarity associated with global convergence of algorithms
- SOCP reformulation for the generalized trust region subproblem via a canonical form of two symmetric matrices
- A primal-dual augmented Lagrangian penalty-interior-point filter line search algorithm
- Efficient solving of boundary value problems using radial basis function networks learned by trust region method
- Bivariate copula additive models for location, scale and shape
- An efficient algorithm for solving the generalized trust region subproblem
- Quadratic programs with hollows
- A computational study of global optimization solvers on two trust region subproblems
- New zero-finders for trust-region computations
- A regularized Newton method for computing ground states of Bose-Einstein condensates
- Mesh-based and meshless design and approximation of scalar functions
- A linear-time algorithm for the trust region subproblem based on hidden convexity
- Exact two steps SOCP/SDP formulation for a modified conic trust region subproblem
- On the construction of quadratic models for derivative-free trust-region algorithms
- A new restarting adaptive trust-region method for unconstrained optimization
- On the use of the energy norm in trust-region and adaptive cubic regularization subproblems
- Slow rotation of a spherical particle inside an elastic tube
- On a two-phase approximate greatest descent method for nonlinear optimization with equality constraints
- Whole root system water conductance responds to both axial and radial traits and network topology over natural range of trait variation
- An adaptive trust region algorithm for large-residual nonsmooth least squares problems
- Eigenvalue-based algorithm and analysis for nonconvex QCQP with one constraint
- Resource allocation with successive coding for OFDM-based cognitive system subject to statistical CSI
- A nonmonotone weighting self-adaptive trust region algorithm for unconstrained nonconvex optimization
- A note on robust descent in differentiable optimization
- Convergence analysis of difference-of-convex algorithm with subanalytic data
- On an elliptical trust-region procedure for ill-posed nonlinear least-squares problems
- A line-search algorithm inspired by the adaptive cubic regularization framework and complexity analysis
- A direct search algorithm for global optimization
- Sub-sampled Newton methods
- DC programming and DCA: thirty years of developments
- Efficient solution of quadratically constrained quadratic subproblems within the mesh adaptive direct search algorithm
- Pricing and revenue maximization over a multicommodity transportation network: the nonlinear demand case
- A matrix-splitting method for symmetric affine second-order cone complementarity problems
- A globally and superlinearly convergent primal-dual interior point trust region method for large scale constrained optimization
- The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
- Convergence properties of Dikin's affine scaling algorithm for nonconvex quadratic minimization
- Mesh refinement and numerical sensitivity analysis for parameter calibration of partial differential equations
- Second-order optimality and beyond: characterization and evaluation complexity in convexly constrained nonlinear optimization
- A geometric analysis of phase retrieval
- Complexity bounds for primal-dual methods minimizing the model of objective function
- A fast branch-and-bound algorithm for non-convex quadratic integer optimization subject to linear constraints using ellipsoidal relaxations
- Convergence detection for optimization algorithms: approximate-KKT stopping criterion when Lagrange multipliers are not available
- A database of planar axisymmetric periodic orbits for the solar system
- Planar methods and grossone for the conjugate gradient breakdown in nonlinear programming
- An effective adaptive trust region algorithm for nonsmooth minimization
- An iterative algorithm for the conic trust region subproblem
- A penalty-free method with line search for nonlinear equality constrained optimization
- Solitary wave solutions to a class of modified Green-Naghdi systems
- A trust-region algorithm for equality-constrained optimization via a reduced dimension approach.
- Response surface methodology's steepest ascent and step size revisited
- Constrained optimization involving expensive function evaluations: A sequential approach
- A feasible direction method for image restoration
- Evaluating bound-constrained minimization software
- Value-at-risk optimization using the difference of convex algorithm
- A framework for optimization under ambiguity
- Second-order stagewise backpropagation for Hessian-matrix analyses and investigation of negative curvature
- A new modified nonmonotone adaptive trust region method for unconstrained optimization
- Convergence rate of the Pham Dinh-Le Thi algorithm for the trust-region subproblem
- A hybrid differential dynamic programming algorithm for constrained optimal control problems. I: Theory
- On optimizing the sum of the Rayleigh quotient and the generalized Rayleigh quotient on the unit sphere
- Gradient trust region algorithm with limited memory BFGS update for nonsmooth convex minimization
- Preconditioning and globalizing conjugate gradients in dual space for quadratically penalized nonlinear-least squares problems
- Monotone and nonmonotone trust-region-based algorithms for large scale unconstrained optimization problems
- Convergence of Pham Dinh-Le Thi's algorithm for the trust-region subproblem
- Efficient use of parallelism in algorithmic parameter optimization applications
- A comparative study of SQP-type algorithms for nonlinear and nonconvex mixed-integer optimization
- Global minimization using an augmented Lagrangian method with variable lower-level constraints
- Learning radial basis function networks with the trust region method for boundary problems
- An active-set algorithm and a trust-region approach in constrained minimax problem
- A certified model reduction approach for robust parameter optimization with PDE constraints
- Optimality of orders one to three and beyond: characterization and evaluation complexity in constrained nonconvex optimization
- A new nonmonotone line-search trust-region approach for nonlinear systems
- On the smoothness of nonlinear system identification
- A comparison of Euclidean distance, travel times, and network distances in location choice mixture models
- A Cauchy point direction trust region algorithm for nonlinear equations
- A reduced-space line-search method for unconstrained optimization via random descent directions
- Machine-learning in optimization of expensive black-box functions
- A dual gradient-projection method for large-scale strictly convex quadratic problems
This page was built for publication: Trust Region Methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4508925)