A convergent decomposition method for box-constrained optimization problems
From MaRDI portal
Publication:839804
DOI10.1007/S11590-009-0119-8zbMATH Open1170.90485OpenAlexW2008698372MaRDI QIDQ839804FDOQ839804
Authors: Andrea Cassioli, Marco Sciandrone 
Publication date: 3 September 2009
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/2158/388516
Recommendations
- A decomposition method for large-scale box constrained optimization
- Decomposition algorithm model for singly linearly-constrained problems subject to lower and Upper bounds
- An incremental decomposition method for unconstrained optimization
- Constraint decomposition algorithms in global optimization
- scientific article; zbMATH DE number 3959124
Cites Work
- Newton's Method for Large Bound-Constrained Optimization Problems
- A coordinate gradient descent method for nonsmooth separable minimization
- On the convergence of the block nonlinear Gauss-Seidel method under convex constraints
- Title not available (Why is that?)
- Downlink beamforming for DS-CDMA mobile radio with multimedia services
- Handbook of applied optimization
- Algorithms for bound constrained quadratic programming problems
- A simple decomposition method for support vector machines
- Decomposition algorithm model for singly linearly-constrained problems subject to lower and Upper bounds
- An algorithm for a singly constrained class of quadratic programs subject upper and lower bounds
- A Truncated Newton Algorithm for Large Scale Box Constrained Optimization
- On the convergence of the coordinate descent method for convex differentiable minimization
- Title not available (Why is that?)
Cited In (16)
- On box-constrained total least squares problem
- New algorithms for maximization of concave functions with box constraints
- A decomposition method for large-scale box constrained optimization
- An incremental decomposition method for unconstrained optimization
- The 2-coordinate descent method for solving double-sided simplex constrained minimization problems
- An efficient algorithm for solving semi-infinite inequality problems with box constraints
- A general solution to least squares problems with box constraints and its applications
- On a box-constrained linear symmetric cone optimization problem
- Components identification based method for box constrained variational inequality problems with almost linear functions
- On the convergence of a Jacobi-type algorithm for singly linearly-constrained problems subject to simple bounds
- Decomposition algorithm model for singly linearly-constrained problems subject to lower and Upper bounds
- A feasible decomposition method for constrained equations and its application to complementarity problems
- A path following method for box-constrained multiobjective optimization with applications to goal programming problems
- Solutions and optimality criteria to box constrained nonconvex minimization problems
- Generating box-constrained optimization problems
- Search heuristics for box decomposition methods
Uses Software
This page was built for publication: A convergent decomposition method for box-constrained optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q839804)
