Space-decomposition multiplier method for constrained minimization problems
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1283896
- Non-monotone space decomposition methods for minimization problems
- Separable diagonalized multiplier method for decomposition nonlinear programs
- Space-decomposition minimization method for large-scale minimization problems
- Una nota sul metodo dei moltiplicatori
Cites work
- A gradient projection-multiplier method for nonlinear programming
- A Perturbed Parallel Decomposition Method for a Class of Nonsmooth Convex Minimization Problems
- Decomposition into functions in the minimization problem
- scientific article; zbMATH DE number 3309655 (Why is no real title available?)
- Impact of partial separability on large-scale optimization
- Lagrange programming neural networks
- Multiplier and gradient methods
- New inexact parallel variable distribution algorithms
- Nonlinear programming codes. Information, tests, performance
- On implementation of computational algorithms for optimal design 2: Extensive numerical investigation
- On the convergence of the exponential multiplier method for convex programming
- On the convergence rate for a penalty function method of exponential type
- Parallel Variable Distribution
- Parallel Variable Transformation in Unconstrained Optimization
- Penalty/Barrier Multiplier Methods for Convex Programming Problems
- Space-decomposition minimization method for large-scale minimization problems
- The multiplier method of Hestenes and Powell applied to convex programming
Cited in
(2)
This page was built for publication: Space-decomposition multiplier method for constrained minimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5948691)
