On the regularization method for conflicting problems of convex programming
type: Item
instance of: scholarly article
title: On the regularization method for conflicting problems of convex programming
zbMATH Open document ID: 0886.90115
author: V. D. Skarin
published in: Russian Mathematics
publication date: 1998-03-09T00:00:00Z
review text: We consider the problem \[ \min\{f_0(x): x\in X\},\tag{1} \] where \(X= \{x: f(x)\leq 0\}\), \(f(x)= [f_1(x),\dots, f_m(x)]^T\), and the \(f_i(x)\) are convex differentiable functions defined on \(\mathbb{R}^n\) \((i=0,1,\dots, m)\). For this problem, we construct a Lagrange function regularized with respect to the direct and dual variables \[ L_\sigma(x,\lambda)= f_0(x)+ (\lambda,f(x))+ \alpha|x|^2- \beta|\lambda|^2, \] where \([x,\lambda]\in \mathbb{R}^n\times \mathbb{R}_+^m\), \(\sigma= [\alpha,\beta]>0\), \(|\cdot|\) stands for the Euclidean norm in a corresponding space. The function \(L_\sigma (x,\lambda)\) for any \(\sigma>0\) has a unique saddle point \([x^\sigma, \lambda^\sigma]\) in the domain \(\mathbb{R}^n\times \mathbb{R}_+^m\). This advantageous property distinguishes our case from the customary Lagrange function \(L_0(x,\lambda)= f_0(x)+ (\lambda,f(x))\) for problem (1). For instance, the latter function has no saddle points if the system of constraints \(f_i(x)\leq 0\), \(i=1,\dots, m\), is an inconsistent one. On the other hand, the problem of convex programming (CP) with conflicting constraints is an example of an improper optimization problem, which often occurs in practice of mathematical simulation. Therefore, the question of construction of effective schemes for correction of such problems seems to be actual. In particular, we consider this correction in terms of the function \(L_\sigma(x,\lambda)\). In earlier articles we had previously established estimates, which characterize convergence of the points \(x^\sigma\) and \(\lambda^\sigma\) for a resolvable regular problem of CP. The connection between \(\lambda\) behavior of \([x^\sigma, \lambda^\sigma]\) and the solution of certain approximate problem for (1) was studied for some classes of improper CP problems in recent papers of the author. On the whole, these articles deal with an analysis of convergence of the \(x\)-components of the saddle points as \(\sigma\to 0\), and the question of th…
Mathematics Subject Classification ID: 90C25
zbMATH DE Number: 1122695
zbMATH Keywords: regularization method
zbMATH Keywords: convex programming
zbMATH Keywords: convergence
MaRDI profile type: Publication
Recommended article: Q3035145
Recommended article: Exact Regularization of Convex Programs
Recommended article: Q3468887
Recommended article: On the application of the regularization method for the correction of improper problems of convex programming
Recommended article: A Regularization Method for Solving the Finite Convex Min-Max Problem
Recommended article: Regularized optimization methods for convex MINLP problems
Recommended article: On a method of iterative regularization for convex minimization problems
Recommended article: A choice of the regularization parameter in solving convex extremal problems
Recommended article: Convergence properties of a regularization scheme for mathematical programs with complementarity constraints
Recommended article: A dual regularized method for solving a class of convex minimization problems
description: scientific article; zbMATH DE number 1122695