KFU. Card publication. A Relaxed Cutting Method for the Convex Programming Problem

KAZAN
FEDERAL UNIVERSITY

- RUS
- 中文
- ES

A RELAXED CUTTING METHOD FOR THE CONVEX PROGRAMMING PROBLEM

Form of presentation

Articles in international journals and collections

Year of publication

2024

Язык

английский

Authors, employees of KFU

Zabotin Igor Yaroslavich, author

Shulgina Oksana Nikolaevna, author

Yarullin Rashid Samatovich, author

Bibliographic description in the original language

Zabotin I, Shulgina O, Yarullin R., A Relaxed Cutting Method for the Convex Programming Problem//Communications in Computer and Information Science CCIS. - 2024. - Vol.2239. - P.59-70. (Scopus)

Keywords

convex programming, constrained minimization, iteration point, approximating set, cutting plane, epigraph of a function, convergence, e-solution

The name of the journal

Communications in Computer and Information Science

URL

https://www.scopus.com/inward/record.uri?eid=2-s2.0-85214197818&doi=10.1007%2f978-3-031-73365-9_4&partnerID=40&md5=88ce08f4003d695fbb77702456e8729f

Please use this ID to quote from or refer to the card

https://repository.kpfu.ru/eng/?p_id=309630&p_lang=2

Full metadata record

Field DC	Value	Language
dc.contributor.author	Zabotin Igor Yaroslavich	ru_RU
dc.contributor.author	Shulgina Oksana Nikolaevna	ru_RU
dc.contributor.author	Yarullin Rashid Samatovich	ru_RU
dc.date.accessioned	2024-01-01T00:00:00Z	ru_RU
dc.date.available	2024-01-01T00:00:00Z	ru_RU
dc.date.issued	2024	ru_RU
dc.identifier.citation	Zabotin I, Shulgina O, Yarullin R., A Relaxed Cutting Method for the Convex Programming Problem//Communications in Computer and Information Science CCIS. - 2024. - Vol.2239. - P.59-70. (Scopus)	ru_RU
dc.identifier.uri	https://repository.kpfu.ru/eng/?p_id=309630&p_lang=2	ru_RU
dc.description.abstract	Communications in Computer and Information Science	ru_RU
dc.language.iso	ru	ru_RU
dc.subject	convex programming	ru_RU
dc.subject	constrained minimization	ru_RU
dc.subject	iteration point	ru_RU
dc.subject	approximating set	ru_RU
dc.subject	cutting plane	ru_RU
dc.subject	epigraph of a function	ru_RU
dc.subject	convergence	ru_RU
dc.subject	e-solution	ru_RU
dc.title	A Relaxed Cutting Method for the Convex Programming Problem	ru_RU
dc.type	Articles in international journals and collections	ru_RU