Pages that link to "Item:Q839804"
From MaRDI portal
The following pages link to A convergent decomposition method for box-constrained optimization problems (Q839804):
Displaying 17 items.
- An incremental decomposition method for unconstrained optimization (Q272371) (← links)
- The 2-coordinate descent method for solving double-sided simplex constrained minimization problems (Q463005) (← links)
- A feasible decomposition method for constrained equations and its application to complementarity problems (Q475708) (← links)
- On the convergence of a Jacobi-type algorithm for singly linearly-constrained problems subject to simple bounds (Q537652) (← links)
- On box-constrained total least squares problem (Q827567) (← links)
- Components identification based method for box constrained variational inequality problems with almost linear functions (Q1014895) (← links)
- Decomposition algorithm model for singly linearly-constrained problems subject to lower and Upper bounds (Q1029281) (← links)
- An efficient algorithm for solving semi-infinite inequality problems with box constraints (Q1334924) (← links)
- A path following method for box-constrained multiobjective optimization with applications to goal programming problems (Q1423708) (← links)
- A decomposition method for large-scale box constrained optimization (Q1644498) (← links)
- A general solution to least squares problems with box constraints and its applications (Q1793094) (← links)
- Search heuristics for box decomposition methods (Q1862173) (← links)
- Methods of descent over groups of variables for a class of constrained minimization problems (Q1915678) (← links)
- On a box-constrained linear symmetric cone optimization problem (Q2420823) (← links)
- Solutions and optimality criteria to box constrained nonconvex minimization problems (Q2469802) (← links)
- Generating box-constrained optimization problems (Q3840044) (← links)
- New algorithms for maximization of concave functions with box constraints (Q4021561) (← links)
