Space-decomposition multiplier method for constrained minimization problems
From MaRDI portal
Publication:5948691
DOI10.1016/S0898-1221(01)85005-7zbMath0980.90086MaRDI QIDQ5948691
Ching-Huan Tseng, Chin-Sung Liu
Publication date: 12 November 2001
Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Cites Work
- Unnamed Item
- On the convergence of the exponential multiplier method for convex programming
- Decomposition into functions in the minimization problem
- Nonlinear programming codes. Information, tests, performance
- A gradient projection-multiplier method for nonlinear programming
- On the convergence rate for a penalty function method of exponential type
- New inexact parallel variable distribution algorithms
- Impact of partial separability on large-scale optimization
- Space-decomposition minimization method for large-scale minimization problems
- Multiplier and gradient methods
- The multiplier method of Hestenes and Powell applied to convex programming
- A Perturbed Parallel Decomposition Method for a Class of Nonsmooth Convex Minimization Problems
- On implementation of computational algorithms for optimal design 2: Extensive numerical investigation
- Lagrange programming neural networks
- Parallel Variable Transformation in Unconstrained Optimization
- Parallel Variable Distribution
- Penalty/Barrier Multiplier Methods for Convex Programming Problems
This page was built for publication: Space-decomposition multiplier method for constrained minimization problems
