CORE
🇺🇦
make metadata, not war
Services
Services overview
Explore all CORE services
Access to raw data
API
Dataset
FastSync
Content discovery
Recommender
Discovery
OAI identifiers
OAI Resolver
Managing content
Dashboard
Bespoke contracts
Consultancy services
Support us
Support us
Membership
Sponsorship
Community governance
Advisory Board
Board of supporters
Research network
About
About us
Our mission
Team
Blog
FAQs
Contact us
A Cutting Method with Approximation of a Constraint Region and an Epigraph for Solving Conditional Minimization Problems
Authors
Shulgina O.
Yarullin R.
Zabotin I.
Publication date
1 January 2018
Publisher
Abstract
© 2018, Pleiades Publishing, Ltd. We propose a method which belongs to a class of cutting methods for solving a convex programming problem. The developed method differs from traditional algorithms of the mentioned class by the following fact. This method uses approximation of the feasible set and the epigraph of the objective function simultaneously for the solving problem. In the method cutting planes are constructed by subgradients of the objective function and functions which define the constrained set. In this case while initial approximating sets are chosen as polyhedral sets, each iteration point is found by solving a linear programming problem independently of the type of functions which define the solving problem. Moreover, unlike most the cutting methods the proposed method is characterized by possibility of updating approximating sets due to dropping accumulating constraints
Similar works
Full text
Open in the Core reader
Download PDF
Available Versions
Kazan Federal University Digital Repository
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:dspace.kpfu.ru:net/149138
Last time updated on 07/05/2019