Relaxed cutting method with updating approximating sets

We propose a method for solving a general convex programming problem, which belongs to the class of cutting methods. This method uses approximation both the problem's constraint region and the epigraph of its objective function by polyhedral sets to construct iteration points. We construct a sequence of iteration points according to the relaxation condition, and it is possible to estimate the proximity of the objective function's current values with its optimal value at each step of the method. The method is also characterized by the fact that it allows periodic updates of the approximating sets by discarding the cutting planes that form them. We prove the convergence of the method and discuss its implementations.

Authors

Institutions

Publication Details

Journal
Numerical Algebra Control and Optimization
Published
2026-11-16
DOI
https://doi.org/10.3934/naco.2026031
Primary Topic
Advanced Optimization Algorithms Research
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
article

Relaxed cutting method with updating approximating sets

Igor Zabotin, Oksana Shulgina, Rashid Yarullin
Numerical Algebra Control and Optimization
Advanced Optimization Algorithms Research
article

Relaxed cutting method with updating approximating sets

Igor Zabotin, Oksana Shulgina, Rashid Yarullin
article en

Abstract

We propose a method for solving a general convex programming problem, which belongs to the class of cutting methods. This method uses approximation both the problem's constraint region and the epigraph of its objective function by polyhedral sets to construct iteration points. We construct a sequence of iteration points according to the relaxation condition, and it is possible to estimate the proximity of the objective function's current values with its optimal value at each step of the method. The method is also characterized by the fact that it allows periodic updates of the approximating sets by discarding the cutting planes that form them. We prove the convergence of the method and discuss its implementations.

Numerical Algebra Control and OptimizationVol. 20(0)
Kazan Federal University (RU)
Advanced Optimization Algorithms Research
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon