A Relaxed Version of the Cutting Method with Approximation of the Constraint Region

被引：0

作者：

Zabotin, I. Ya. ^{[1
]}

Shulgina, O. N. ^{[1
]}

Yarullin, R. S. ^{[1
]}

机构：

[1] Kazan Fed Univ, Kazan 420008, Russia

来源：

UCHENYE ZAPISKI KAZANSKOGO UNIVERSITETA-SERIYA FIZIKO-MATEMATICHESKIE NAUKI | 2023年 / 165卷 / 02期

关键词：

convex programming; sequence of approximation; relaxation; convergence; approximation; generalized support vector; subdifferential; cutting plane;

D O I：

10.26907/2541-7746.2023.2.143-152

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

A cutting method was proposed for solving the convex programming problem. The method assumes that the constraint region of the problem is embedded into some polyhedral sets for constructing iteration points. It involves the construction of a sequence of approximations that belongs to the admissible set and is relaxed, as well as implies that the e-solution of the initial problem is fixed after a finite number of steps. The method also allows to obtain mixed convergent algorithms by using, if desired, any known or new relaxation algorithms for constructing the main iteration points.

引用

页码：143 / 152

页数：10

共 50 条

[41] Robust positioning using relaxed constraint-propagation
Drevelle, Vincent
Bonnifait, Philippe
IEEE/RSJ 2010 INTERNATIONAL CONFERENCE ON INTELLIGENT ROBOTS AND SYSTEMS (IROS 2010), 2010, : 4843 - 4848
[42] Relaxed Genetic Constraint is Ancestral to the Evolution of Phenotypic Plasticity
Leichty, Aaron R.
Pfennig, David W.
Jones, Corbin D.
Pfennig, Karin S.
INTEGRATIVE AND COMPARATIVE BIOLOGY, 2012, 52 (01) : 16 - 30
[43] A robust trust region method for nonlinear optimization with inequality constraint
Zhang, Ju-liang
APPLIED MATHEMATICS AND COMPUTATION, 2006, 176 (02) : 688 - 699
[44] An optimal control problem with a relaxed state constraint.
Aseev, S. M.
TRUDY INSTITUTA MATEMATIKI I MEKHANIKI URO RAN, 2024, 30 (03): : 14 - 29
[45] Simultaneous numerical approximation of microstructures and relaxed minimizers
Li, ZP
NUMERISCHE MATHEMATIK, 1997, 78 (01) : 21 - 38
[46] RELAXED MULTIBANG REGULARIZATION FOR THE COMBINATORIAL INTEGRAL APPROXIMATION
Manns, Paul
SIAM JOURNAL ON CONTROL AND OPTIMIZATION, 2021, 59 (04) : 2645 - 2668
[47] Simultaneous numerical approximation of microstructures and relaxed minimizers
Zhiping Li
Numerische Mathematik, 1997, 78 : 21 - 38
[48] Simultaneous numerical approximation of microstructures and relaxed minimizers
Li, Z.
Numerische Mathematik, 78 (01):
[49] Adaptive approximation algorithm for relaxed optimization problems
Roubícek, T
Kruzík, M
FAST SOLUTION OF DISCRETIZED OPTIMIZATION PROBLEMS, 2001, 138 : 242 - 254
[50] MULTIPLICATIVE VERSION OF GOMORYS CUTTING PLANE ALGORITHM AND ITS COMBINATIONS WITH BRANCHING METHOD
RYNDIN, BN
VESTNIK LENINGRADSKOGO UNIVERSITETA SERIYA MATEMATIKA MEKHANIKA ASTRONOMIYA, 1977, (02): : 85 - 89

← 1 2 3 4 5 →