An accurate active set Newton algorithm for large scale bound constrained optimization.
From MaRDI portal
(Redirected from Publication:548593)
Recommendations
- An active set limited memory BFGS algorithm for large-scale bound constrained optimization
- 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 conjugate gradient algorithm with project search for bound constrained optimization
- An active set feasible method for large-scale minimization problems with bound constraints
Cites work
- A Characterization of Superlinear Convergence and Its Application to Quasi-Newton Methods
- 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 subspace limited memory quasi-Newton algorithm for large-scale nonlinear bound constrained optimization
- Active Set Identification in Nonlinear Programming
- An Active Set Newton Algorithm for Large-Scale Nonlinear Programs with Box Constraints
- An Interior Trust Region Approach for Nonlinear Minimization Subject to Bounds
- An \(RQP\) algorithm using a differentiable exact penalty function for inequality constrained problems
- An active set quasi-Newton method with projected search for bound constrained minimization
- An active set strategy based on the multiplier function or the gradient.
- Convergence of Trust Region Algorithms for Optimization with Bounds when Strict Complementarity Does Not Hold
- Convergence of a generalized SMO algorithm for SVM classifier design
- Correction to the Paper on Global Convergence of a Class of Trust Region Algorithms for Optimization with Simple Bounds
- Generating box-constrained optimization problems
- Global Convergence of a Class of Trust Region Algorithms for Optimization with Simple Bounds
- Minimization of \(SC^ 1\) functions and the Maratos effect
- More test examples for nonlinear programming codes
- 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 convergence of interior-reflective Newton methods for nonlinear minimization subject to bounds
- Quadratically and superlinearly convergent algorithms for the solution of inequality constrained minimization problems
- Superlinear and quadratic convergence of affine-scaling interior-point Newton methods for problems with simple bounds without strict complementarity assumption
- Testing Unconstrained Optimization Software
- The conjugate gradient method in extremal problems
- Working set selection using second order information for training support vector machines
Cited in
(24)- Recent advances in bound constrained optimization
- A truncated Newton method for the solution of large-scale inequality constrained minimization problems
- On the numerical solution of bound constrained optimization problems
- scientific article; zbMATH DE number 724210 (Why is no real title available?)
- A quasi-Monte-Carlo-based feasible sequential system of linear equations method for stochastic programs with recourse
- A two-stage active-set algorithm for bound-constrained optimization
- A limited memory quasi-Newton trust-region method for box constrained optimization
- scientific article; zbMATH DE number 5670814 (Why is no real title available?)
- An active set strategy based on the multiplier function or the gradient.
- Image restoration by second-order total generalized variation and wavelet frame regularization
- A new smoothing method for solving nonlinear complementarity problems
- An active set quasi-Newton method with projected search for bound constrained minimization
- An Active Set Newton Algorithm for Large-Scale Nonlinear Programs with Box Constraints
- On Smoothingl1Exact Penalty Function for Constrained Optimization Problems
- 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 Newton's interior-point algorithm for solving a constrained optimization problem
- An accelerated three-term conjugate gradient method with sufficient descent condition and conjugacy condition
- An efficient adaptive three-term extension of the Hestenes-Stiefel conjugate gradient method
- A new conjugate gradient method based on quasi-Newton equation for unconstrained 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
- Hybrid variational model based on alternating direction method for image restoration
- Image restoration by a mixed high-order total variation and \(l_1\) regularization model
This page was built for publication: An accurate active set Newton algorithm for large scale bound constrained optimization.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q548593)
