Global Convergence of a Class of Trust Region Algorithms for Optimization with Simple Bounds
From MaRDI portal
Publication:3785830
DOI10.1137/0725029zbMath0643.65031MaRDI QIDQ3785830
No author found.
Publication date: 1988
Published in: SIAM Journal on Numerical Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0725029
global convergence; constrained optimization; cubic spline collocation method; Uniform convergence; Cauchy point; trust region algorithms
Related Items
Convergence of a projected gradient method with trust region for nonlinear constrained optimization†, A Trust Regional Algorithm for Bound Constrained Minimization, A subspace limited memory quasi-Newton algorithm for large-scale nonlinear bound constrained optimization, Convergence of quasi-Newton matrices generated by the symmetric rank one update, A hybrid method for the nonlinear least squares problem with simple bounds, New constrained optimization reformulation of complementarity problems, A sequential quadratic programming-based algorithm for the optimization of gas networks, A new trust region algorithm for bound constrained minimization, An unconstrained optimization technique for large-scale linearly constrained convex minimization problems, A note on exploiting structure when using slack variables, A trust region method for minimization of nonsmooth functions with linear constraints, On unconstrained and constrained stationary points of the implicit Lagrangian, Family of projected descent methods for optimization problems with simple bounds, Solution of finite-dimensional variational inequalities using smooth optimization with simple bounds, Convergence properties of improved secant methods with region multiplier, A trust region algorithm for parametric curve and surface fitting, A trust-region strategy for minimization on arbitrary domains, Solution of linear complementarity problems using minimization with simple bounds, An investigation of interior-point and block pivoting algorithms for large-scale symmetric monotone linear complementarity problems, Numerical experiments with the Lancelot package (Release \(A\)) for large-scale nonlinear optimization
