C-programming. An outline
type: Item
instance of: scholarly article
title: C-programming. An outline
zbMATH Open document ID: 0569.90079
DOI: 10.1016/0167-6377(85)90045-8
published in: Operations Research Letters
publication date: 1985-01-01T00:00:00Z
review text: This paper presents the essentials of a method designed to solve optimization problems whose objective functions are of the form \(g(x)+\psi (u(x))\), where \(\psi\) is differentiable and either concave or convex. It is shown that solutions to such problems can be obtained through the solutions of the Lagrangian problem whose objective function is of the form \(g(x)+\lambda u(x)\).
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 49M37
Mathematics Subject Classification ID: 65K05
zbMATH DE Number: 3910153
zbMATH Keywords: c-programming
zbMATH Keywords: convex functions
zbMATH Keywords: Lagrangian problems
zbMATH Keywords: sum objective
zbMATH Keywords: composite objective function
author: Moshe Sniedovich
MaRDI profile type: Publication
full work available at URL: 0167-6377(85)90045-8
OpenAlex ID: W1978489703
cites work: An approach to nonlinear programming
cites work: Analysis of a class of proxy problems
description: scientific article; zbMATH DE number 3910153