A decomposition method for large-scale box constrained optimization
From MaRDI portal
Recommendations
- Decomposition algorithm model for singly linearly-constrained problems subject to lower and Upper bounds
- A convergent decomposition algorithm for support vector machines
- Large-scale active-set box-constrained optimization method with spectral projected gradients
- A convergent decomposition method for box-constrained optimization problems
- A new convergent decomposition algorithm for solving large scale support vector machines
Cites work
- A convergent decomposition algorithm for support vector machines
- A New Active Set Algorithm for Box Constrained Optimization
- A new trust region algorithm for bound constrained minimization
- A subspace limited memory quasi-Newton algorithm for large-scale nonlinear bound constrained optimization
- A Truncated Newton Algorithm for Large Scale Box Constrained Optimization
- An Active Set Newton Algorithm for Large-Scale Nonlinear Programs with Box Constraints
- Box Constrained Quadratic Programming with Proportioning and Projections
- Convergence of Trust Region Algorithms for Optimization with Bounds when Strict Complementarity Does Not Hold
- Downlink beamforming for DS-CDMA mobile radio with multimedia services
- Estimation of the optimal constants and the thickness of thin films using unconstrained optimization
- Function minimization by conjugate gradients
- Global Convergence of a Class of Trust Region Algorithms for Optimization with Simple Bounds
- scientific article; zbMATH DE number 1694901 (Why is no real title available?)
- scientific article; zbMATH DE number 3159112 (Why is no real title available?)
- scientific article; zbMATH DE number 3919744 (Why is no real title available?)
- scientific article; zbMATH DE number 3596197 (Why is no real title available?)
- scientific article; zbMATH DE number 1314294 (Why is no real title available?)
- On affine-scaling interior-point Newton methods for nonlinear minimization with bound constraints
- On the Solution of Large Quadratic Programming Problems with Bound Constraints
- Superlinear and quadratic convergence of affine-scaling interior-point Newton methods for problems with simple bounds without strict complementarity assumption
- The conjugate gradient method in extremal problems
Cited in
(24)- Decomposition algorithm model for singly linearly-constrained problems subject to lower and Upper bounds
- An accelerated three-term conjugate gradient method with sufficient descent condition and conjugacy condition
- A note on the decomposition method for large-scale box constrained optimization
- A new conjugate gradient method based on quasi-Newton equation for unconstrained optimization
- Hybrid variational model based on alternating direction method for image restoration
- The simple finite volume Lax-Wendroff weighted essentially nonoscillatory schemes for shallow water equations with bottom topography
- Image restoration by a mixed high-order total variation and \(l_1\) regularization model
- Quantum multi-proxy blind signature scheme based on four-qubit cluster states
- Arbitrary quantum signature based on local indistinguishability of orthogonal product states
- A quasi-Monte-Carlo-based feasible sequential system of linear equations method for stochastic programs with recourse
- Simple hash function using discrete-time quantum walks
- Tikhonov regularized variable projection algorithms for separable nonlinear least squares problems
- An analytical method for reducing metal artifacts in X-ray CT images
- Sequential quadratic programming method for nonlinear least squares estimation and its application
- Verifiable quantum secret sharing protocols based on four-qubit entangled states
- Image restoration by second-order total generalized variation and wavelet frame regularization
- A new smoothing method for solving nonlinear complementarity problems
- scientific article; zbMATH DE number 432997 (Why is no real title available?)
- An efficient adaptive three-term extension of the Hestenes-Stiefel conjugate gradient method
- On smoothing $l_1$ exact penalty function for constrained optimization problems
- A new convergent decomposition algorithm for solving large scale support vector machines
- Fast algorithms for sparse inverse covariance estimation
- Two-party quantum key agreement over a collective noisy channel
- A convergent decomposition method for box-constrained optimization problems
This page was built for publication: A decomposition method for large-scale box constrained optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1644498)
