An active set feasible method for large-scale minimization problems with bound constraints
From MaRDI portal
Recommendations
- An active set truncated Newton method for large-scale bound constrained optimization
- An active set quasi-Newton method with projected search for bound constrained minimization
- An accurate active set Newton algorithm for large scale bound constrained optimization.
- An active set limited memory BFGS algorithm for large-scale bound constrained optimization
- A new subspace limited memory BFGS algorithm for large-scale bound constrained optimization
Cites work
- A New Active Set Algorithm for Box Constrained Optimization
- A new trust region algorithm for bound constrained minimization
- A nonmonotone truncated Newton-Krylov method exploiting negative curvature directions, for large scale unconstrained optimization
- A Truncated Newton Algorithm for Large Scale Box Constrained Optimization
- A truncated Newton method with non-monotone line search for unconstrained optimization
- Algorithms for bound constrained quadratic programming problems
- Benchmarking optimization software with performance profiles.
- CUTEr and SifDec
- Evaluating bound-constrained minimization software
- Family of projected descent methods for optimization problems with simple bounds
- GALAHAD, a library of thread-safe Fortran 90 packages for large-scale nonlinear optimization
- Global Convergence of a Class of Trust Region Algorithms for Optimization with Simple Bounds
- Global Convergence of Trust-region Interior-point Algorithms for Infinite-dimensional Nonconvex Minimization Subject to Pointwise Bounds
- scientific article; zbMATH DE number 1694901 (Why is no real title available?)
- Large-scale active-set box-constrained optimization method with spectral projected gradients
- Newton's Method for Large Bound-Constrained Optimization Problems
- On affine-scaling interior-point Newton methods for nonlinear minimization with bound constraints
- On the Solution of Large Quadratic Programming Problems with Bound Constraints
- Projected Newton Methods for Optimization Problems with Simple Constraints
- Second-order negative-curvature methods for box-constrained and general constrained optimization
- Superlinear and quadratic convergence of affine-scaling interior-point Newton methods for problems with simple bounds without strict complementarity assumption
- Truncated-Newton algorithms for large-scale unconstrained optimization
- Trust-Region Interior-Point SQP Algorithms for a Class of Nonlinear Programming Problems
Cited in
(29)- Subspace Barzilai-Borwein gradient method for large-scale bound constrained optimization
- An active set modified Polak-Ribiére-Polyak method for large-scale nonlinear bound constrained optimization
- An augmented Lagrangian method exploiting an active-set strategy and second-order information
- A novel projected gradient-like method for optimization problems with simple constraints
- A conjugate direction based simplicial decomposition framework for solving a specific class of dense convex quadratic programs
- A two-stage active-set algorithm for bound-constrained optimization
- An active set-type Newton method for constrained nonlinear systems
- A fast active set block coordinate descent algorithm for _1-regularized least squares
- An active set truncated Newton method for large-scale bound constrained optimization
- An extension of the conjugate directions method with orthogonalization to large-scale problems with bound constraints
- scientific article; zbMATH DE number 5670814 (Why is no real title available?)
- A matrix-free approach to build band preconditioners for large-scale bound-constrained optimization
- scientific article; zbMATH DE number 1497138 (Why is no real title available?)
- Active-set Methods for Submodular Minimization Problems
- An active set trust region method for general bound constrained optimization
- Dual approaches for a specific class of integer nonlinear programming problems
- Total variation based community detection using a nonlinear optimization approach
- Active set complexity of the away-step Frank-Wolfe algorithm
- PNKH-B: A Projected Newton--Krylov Method for Large-Scale Bound-Constrained Optimization
- First-order Methods for the Impatient: Support Identification in Finite Time with Convergent Frank--Wolfe Variants
- An accurate active set Newton algorithm for large scale bound constrained optimization.
- Efficient Nonnegative Matrix Factorization Via Modified Monotone Barzilai-Borwein Method with Adaptive Step Sizes Strategy
- A class of projected-search methods for bound-constrained optimization
- Combinatorial optimal control of semilinear elliptic PDEs
- An augmented Lagrangian-based method using primitive directions for mixed-integer nonlinear problems
- New active set identification for general constrained optimization and minimax problems
- An active-set algorithmic framework for non-convex optimization problems over the simplex
- A new subspace limited memory BFGS algorithm for large-scale bound constrained optimization
- An active set quasi-Newton method with projected search for bound constrained minimization
This page was built for publication: An active set feasible method for large-scale minimization problems with bound constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1928749)
