A trust region method based on a new affine scaling technique for simple bounded optimization
From MaRDI portal
Publication:2867413
DOI10.1080/10556788.2011.622378zbMath1307.90174OpenAlexW2031655766MaRDI QIDQ2867413
Publication date: 19 December 2013
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556788.2011.622378
Related Items (9)
A limited memory quasi-Newton trust-region method for box constrained optimization ⋮ Trust region algorithm with two subproblems for bound constrained problems ⋮ A penalty method with trust-region mechanism for nonlinear bilevel optimization problem ⋮ An augmented Lagrangian affine scaling method for nonlinear programming ⋮ On affine-scaling inexact dogleg methods for bound-constrained nonlinear systems ⋮ A partial first-order affine-scaling method ⋮ An active-set algorithm and a trust-region approach in constrained minimax problem ⋮ Recent advances in trust region algorithms ⋮ A class of improved affine-scaling interior-point secant filter methods for minimization with equality and box constraints
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A modification of Karmarkar's linear programming algorithm
- On affine-scaling interior-point Newton methods for nonlinear minimization with bound constraints
- A new trust region algorithm for bound constrained minimization
- On the convergence of interior-reflective Newton methods for nonlinear minimization subject to bounds
- Family of projected descent methods for optimization problems with simple bounds
- Projected Barzilai-Borwein methods for large-scale box-constrained quadratic programming
- Convergence properties of Dikin's affine scaling algorithm for nonconvex quadratic minimization
- Large-scale active-set box-constrained optimization method with spectral projected gradients
- An affine scaling trust-region approach to bound-constrained nonlinear systems
- A convergence analysis for a convex version of Dikin's algorithm
- Superlinear and quadratic convergence of affine-scaling interior-point Newton methods for problems with simple bounds without strict complementarity assumption
- A variation on Karmarkar’s algorithm for solving linear programming problems
- Convergence of Trust Region Algorithms for Optimization with Bounds when Strict Complementarity Does Not Hold
- A New Active Set Algorithm for Box Constrained Optimization
- A recursive Formula-trust-region method for bound-constrained nonlinear optimization
- Global Convergence of a Class of Trust Region Algorithms for Optimization with Simple Bounds
- On the Solution of Large Quadratic Programming Problems with Bound Constraints
- Algorithm 778: L-BFGS-B
- Global Convergence of Trust-region Interior-point Algorithms for Infinite-dimensional Nonconvex Minimization Subject to Pointwise Bounds
- A subspace limited memory quasi-Newton algorithm for large-scale nonlinear bound constrained optimization
- Global Convergence of the Affine Scaling Algorithm for Convex Quadratic Programming
- An Active Set Newton Algorithm for Large-Scale Nonlinear Programs with Box Constraints
- Trust Region Methods
- Newton's Method for Large Bound-Constrained Optimization Problems
- A Truncated Newton Algorithm for Large Scale Box Constrained Optimization
- A Limited Memory Algorithm for Bound Constrained Optimization
- An Interior Trust Region Approach for Nonlinear Minimization Subject to Bounds
- CUTEr and SifDec
- Benchmarking optimization software with performance profiles.
This page was built for publication: A trust region method based on a new affine scaling technique for simple bounded optimization
