Global Convergence of a Class of Trust Region Algorithms for Optimization with Simple Bounds
From MaRDI portal
Publication:3785830
DOI10.1137/0725029zbMath0643.65031OpenAlexW2148589597MaRDI 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 convergenceconstrained optimizationcubic spline collocation methodUniform convergenceCauchy pointtrust region algorithms
Related Items
A proximal trust-region method for nonsmooth optimization with inexact function and gradient evaluations, A derivative-free affine scaling trust region methods based on probabilistic models with new nonmonotone line search technique for linear inequality constrained minimization without strict complementarity, A two-stage active-set algorithm for bound-constrained optimization, A limited memory quasi-Newton trust-region method for box constrained optimization, Trust region algorithm with two subproblems for bound constrained problems, 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 strategy for minimization on arbitrary domains, Solution of linear complementarity problems using minimization with simple bounds, A new regularized quasi-Newton algorithm for unconstrained optimization, A Family of Supermemory Gradient Projection Methods for Constrained Optimization, A second-order optimality condition with first- and second-order complementarity associated with global convergence of algorithms, Modulus Methods for Nonnegatively Constrained Image Restoration, LMBOPT: a limited memory method for bound-constrained optimization, Newton-based optimization for Kullback–Leibler nonnegative tensor factorizations, A decomposition method for large-scale box constrained optimization, A trust region method for minimization of nonsmooth functions with linear constraints, An interior-point affine-scaling trust-region method for semismooth equations with box constraints, On affine-scaling interior-point Newton methods for nonlinear minimization with bound constraints, An active set algorithm for nonlinear optimization with polyhedral constraints, On unconstrained and constrained stationary points of the implicit Lagrangian, Family of projected descent methods for optimization problems with simple bounds, Monotone projected gradient methods for large-scale box-constrained quadratic programming, An investigation of interior-point and block pivoting algorithms for large-scale symmetric monotone linear complementarity problems, Solution of finite-dimensional variational inequalities using smooth optimization with simple bounds, Numerical comparison of merit function with filter criterion in inexact restoration algorithms using hard-spheres problems, A new subspace limited memory BFGS algorithm for large-scale bound constrained optimization, Numerical experiments with the Lancelot package (Release \(A\)) for large-scale nonlinear optimization, Newton's method and its use in optimization, An ODE traffic network model, An alternating trust region algorithm for distributed linearly constrained nonlinear programs, application to the optimal power flow problem, Evaluating bound-constrained minimization software, An active set feasible method for large-scale minimization problems with bound constraints, A matrix-free approach to build band preconditioners for large-scale bound-constrained optimization, Inexact successive quadratic approximation for regularized optimization, Scaling limits in computational Bayesian inversion, A novel projected gradient-like method for optimization problems with simple constraints, Convergence of a projected gradient method with trust region for nonlinear constrained optimization†, A multivariate spectral projected gradient method for bound constrained optimization, Combining nonmonotone conic trust region and line search techniques for unconstrained optimization, Global convergence of trust-region algorithms for convex constrained minimization without derivatives, A nonmonotone trust-region line search method for large-scale unconstrained optimization, A Large-Scale Optimization Method Using a Sparse Approximation of the Hessian for Magnetic Resonance Fingerprinting, An active-set projected trust region algorithm for box constrained optimization problems, Augmented Lagrangian method with nonmonotone penalty parameters for constrained optimization, Global convergence of a modified gradient projection method for convex constrained problems, Low dimensional modeling of double T-junctions in water distribution networks using Kriging interpolation and Delaunay triangulation, On large scale nonlinear network optimization, An active set limited memory BFGS algorithm for bound constrained optimization, A framework for real-time implementation of low-dimensional parameterized NMPC, Convergence properties of trust region methods for linear and convex constraints, An accurate active set conjugate gradient algorithm with project search for bound constrained optimization, A feasible direction method for the semidefinite program with box constraints, An active set limited memory BFGS algorithm for large-scale 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, A Trust Regional Algorithm for Bound Constrained Minimization, Penalty-free method for nonsmooth constrained optimization via radial basis functions, A Trust-Region Algorithm for Heterogeneous Multiobjective Optimization, Trust-region method for box-constrained semismooth equations and its applications to complementary problems, On Regularization and Active-set Methods with Complexity for Constrained Optimization, A subspace limited memory quasi-Newton algorithm for large-scale nonlinear bound constrained optimization, An affine scaling interior trust-region method combining with line search filter technique for optimization subject to bounds on variables, Modified subspace limited memory BFGS algorithm for large-scale bound constrained optimization, Globally convergent DC trust-region methods, A new trust region method for unconstrained optimization, Incorporating nonmonotone strategies into the trust region method for unconstrained optimization, An interior-point method for solving box-constrained underdetermined nonlinear systems, Nonlinear stepsize control, trust regions and regularizations for unconstrained optimization, On the solution of bounded and unbounded mixed complementarity problems, Secant algorithms with nonmonotone trust region that employs fletcher penalty function for constrained optimization, A modified SLP algorithm and its global convergence, An accurate active set Newton algorithm for large scale bound constrained optimization., A penalty-free-type nonmonotone trust-region method for nonlinear constrained optimization, A dual gradient-projection method for large-scale strictly convex quadratic problems, Exploiting Hessian matrix and trust-region algorithm in hyperparameters estimation of Gaussian process, Nonmonotone strategy for minimization of quadratics with simple constraints., An active set quasi-Newton method with projected search for bound constrained minimization, Global Convergence of a Trust Region Algorithm for Nonlinear Inequality Constrained Optimization Problems, A filter-trust-region method for simple-bound constrained optimization, Preconditioned conjugate gradient algorithms for nonconvex problems with box constraints, Adaptive limited memory bundle method for bound constrained large-scale nonsmooth optimization, A direct active set algorithm for large sparse quadratic programs with simple bounds, Approximate solution of system of equations arising in interior-point methods for bound-constrained optimization, A differentiable exact penalty function for bound constrained quadratic programming problems, An algorithm for the fast solution of symmetric linear complementarity problems, Finite element model updating for structural applications, Adaptive augmented Lagrangian methods: algorithms and practical numerical experience, Trust-region quadratic methods for nonlinear systems of mixed equalities and inequalities, Convergence of Affine-Scaling Interior-Point Methods with Line Search for Box Constrained Optimization, New constrained optimization reformulation of complementarity problems, A penalty-function-free line search SQP method for nonlinear programming, Subspace Barzilai-Borwein gradient method for large-scale bound constrained optimization, A trust region algorithm for parametric curve and surface fitting, Testing a Class of Methods for Solving Minimization Problems with Simple Bounds on the Variables, Convergence properties of improved secant methods with region multiplier, A note on the solution to a common thermal network problem encountered in heat-transfer analysis of spacecraft, A trust region method based on a new affine scaling technique for simple bounded optimization, A sequential quadratic programming-based algorithm for the optimization of gas networks
