An active set quasi-Newton method with projected search for bound constrained minimization
From MaRDI portal
(Redirected from Publication:980100)
Recommendations
- An accurate active set Newton algorithm for large scale bound constrained optimization.
- An active set feasible method for large-scale minimization problems with bound constraints
- An active set truncated Newton method for large-scale bound constrained optimization
- An active set limited memory BFGS algorithm for large-scale bound constrained optimization
- An accurate active set conjugate gradient algorithm with project search for bound constrained optimization
Cites work
- scientific article; zbMATH DE number 556481 (Why is no real title available?)
- A Limited Memory Algorithm for Bound Constrained Optimization
- A New Active Set Algorithm for Box Constrained Optimization
- A Truncated Newton Algorithm for Large Scale Box Constrained Optimization
- A new subspace limited memory BFGS algorithm for large-scale bound constrained optimization
- A proportioning based algorithm with rate of convergence for bound constrained quadratic programming
- A truncated Newton method for the solution of large-scale inequality constrained minimization problems
- An Active Set Newton Algorithm for Large-Scale Nonlinear Programs with Box Constraints
- An active set limited memory BFGS algorithm for large-scale bound constrained optimization
- Convergence of a generalized SMO algorithm for SVM classifier design
- Global Convergence of a Class of Trust Region Algorithms for Optimization with Simple Bounds
- Newton Methods For Large-Scale Linear Inequality-Constrained Minimization
- Newton's Method for Large Bound-Constrained Optimization Problems
- On the Accurate Identification of Active Constraints
- On the Solution of Large Quadratic Programming Problems with Bound Constraints
- On the limited memory BFGS method for large scale optimization
- Quadratically and superlinearly convergent algorithms for the solution of inequality constrained minimization problems
- Representations of quasi-Newton matrices and their use in limited memory methods
- Testing a Class of Methods for Solving Minimization Problems with Simple Bounds on the Variables
- Working set selection using second order information for training support vector machines
Cited in
(12)- An active set strategy based on the multiplier function or the gradient.
- A new smoothing method for solving nonlinear complementarity problems
- An accurate active set Newton algorithm for large scale bound constrained optimization.
- On Smoothingl1Exact Penalty Function for Constrained Optimization Problems
- An active set feasible method for large-scale minimization problems with bound constraints
- An active set quasi-Newton method with projection step for monotone nonlinear equations
- An active set truncated Newton method for large-scale bound constrained optimization
- A globally convergent active-set memoryless quasi-Newton method based on spectral-scaling Broyden family for bound constrained optimization
- A class of projected-search methods for bound-constrained optimization
- Active set type algorithms for nonnegative matrix factorization in hyperspectral unmixing
- An accurate active set conjugate gradient algorithm with project search for bound constrained optimization
- Image restoration by a mixed high-order total variation and \(l_1\) regularization model
This page was built for publication: An active set quasi-Newton method with projected search for bound constrained minimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q980100)
