A decomposition method for large-scale box constrained optimization

DOI10.1016/j.amc.2013.12.169zbMath1410.90207OpenAlexW2057227141MaRDI QIDQ1644498

Y. Aharonov

Publication date: 21 June 2018

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2013.12.169

zbMATH Keywords

decomposition methodbox constrained optimizationlarge-scaleKKT-violating indexworking set identification

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Related Items (20)

Fast algorithms for sparse inverse covariance estimation ⋮ 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 ⋮ An efficient adaptive three-term extension of the Hestenes–Stiefel conjugate gradient method ⋮ On Smoothingl₁Exact Penalty Function for Constrained Optimization Problems ⋮ Two-party quantum key agreement over a collective noisy channel ⋮ 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

Uses Software

• SVMlight

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On affine-scaling interior-point Newton methods for nonlinear minimization with bound constraints
• Estimation of the optimal constants and the thickness of thin films using unconstrained optimization
• A new trust region algorithm for bound constrained minimization
• Superlinear and quadratic convergence of affine-scaling interior-point Newton methods for problems with simple bounds without strict complementarity assumption
• A convergent decomposition algorithm for support vector machines
• Convergence of Trust Region Algorithms for Optimization with Bounds when Strict Complementarity Does Not Hold
• A New Active Set Algorithm for Box Constrained 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
• A subspace limited memory quasi-Newton algorithm for large-scale nonlinear bound constrained optimization
• Box Constrained Quadratic Programming with Proportioning and Projections
• An Active Set Newton Algorithm for Large-Scale Nonlinear Programs with Box Constraints
• Downlink beamforming for DS-CDMA mobile radio with multimedia services
• A Truncated Newton Algorithm for Large Scale Box Constrained Optimization
• Function minimization by conjugate gradients
• The conjugate gradient method in extremal problems

This page was built for publication: A decomposition method for large-scale box constrained optimization