IEEE Transactions on Automatic Control · 1985 · 39 citations · 12 references
Natural SciencesComputational EngineeringDesign OptimizationOptimizationSeparation ProcessesConvex AnalysisConvex OptimizationLarge-scale OptimizationNonlinear ProgrammingOptimization TheoryDuality TheoryLagrangian DualityLagrangian FormulationLagrangian FunctionLagrangian OptimizationLarge-scale Convex OptimizationNonconvex OptimizationPrimal-dual Algorithms
The primal-dual approach is quite effective in decomposing a convex separable optimization problem into several subproblems of smaller sizes. In this paper, we present a new technique which extends the primal-dual approach to nonconvex problems. Since a straightforward application of the multiplier method destroys separability, a new Lagrangian function is proposed which preserves separability. Based on this new function we develop a new iterative method for finding an optimal solution to the problem and show that the method is locally convergent to an optimal solution. Furthermore, the effect of certain parameters on the ratio of convergence is investigated and simple examples are given to illustrate the proposed approach.
12
Introduction to linear and nonlinear programming
E. Polak · IEEE Transactions on Automatic Control · 1974 · 2.1K citations
Elements of Functional Analysis.
Robert G. Bartle, L. A. Lusternik, V. J. Sobolev et al. · American Mathematical Monthly · 1962 · 346 citations
Dimitri P. Bertsekas · Automatica · 1976 · 344 citations
Integer and Nonlinear Programming
B. V. Shah, J. Abadie · Technometrics · 1971 · 311 citations