Regularized method of linearization for minimizing a convex function on a polyhedral set with errors in the input data

zbMATH Open0679.90049MaRDI QIDQ1823146

N. T. Chirich

Publication date: 1987

Published in: Moscow University Computational Mathematics and Cybernetics (Search for Journal in Brave)

zbMATH Keywords

Lagrange multipliersstrong convergencegradientspolyhedral setmethod of linearizationerrors in the input data

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25)

Related Items (1)

On the Linear Convergence of Descent Methods for Convex Essentially Smooth Minimization

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• On the application of the regularization method for the correction of improper problems of convex programming 👍 👎
• Regularized optimization methods for convex MINLP problems 👍 👎
• Regularized linearization method with errors in the initial data 👍 👎
• A regularized continuous linearization method for minimization problems with inexact initial data. 👍 👎
• On the construction of regularizing algorithms for the correction of improper convex programming problems 👍 👎
• Error Bound and Reduced-Gradient Projection Algorithms for Convex Minimization over a Polyhedral Set 👍 👎
• On a method of iterative regularization for convex minimization problems 👍 👎

This page was built for publication: Regularized method of linearization for minimizing a convex function on a polyhedral set with errors in the input data

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1823146)