Convexification procedures and decomposition methods for nonconvex optimization problems
type: Item
instance of: scholarly article
title: Convexification procedures and decomposition methods for nonconvex optimization problems
zbMATH Open document ID: 0389.90080
DOI: 10.1007/BF00937167
author: Dimitri P. Bertsekas
published in: Journal of Optimization Theory and Applications
publication date: 1979-01-01T00:00:00Z
Mathematics Subject Classification ID: 90C25
zbMATH DE Number: 3606258
MaRDI profile type: Publication
cites work: Q4051876
cites work: Lagrange multipliers and nonlinear programming
cites work: Q5630824
cites work: Duality in Nonlinear Programming: A Simplified Applications-Oriented Development
cites work: Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of Resources
cites work: Definite and Semidefinite Quadratic Forms
cites work: Multiplier methods: A survey
cites work: The use of Hestenes' method of multipliers to resolve dual gaps in engineering system optimization
cites work: A dual approach to solving nonlinear programming problems by unconstrained optimization
cites work: Combined Primal–Dual and Penalty Methods for Convex Programming
cites work: On the method of multipliers for convex programming
cites work: The multiplier method of Hestenes and Powell applied to convex programming
cites work: Monotone Operators and the Proximal Point Algorithm
cites work: Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
cites work: On Penalty and Multiplier Methods for Constrained Minimization
full work available at URL: https://doi.org/10.1007/bf00937167
OpenAlex ID: W2085890234
description: scientific article; zbMATH DE number 3606258