2025-02-24T00:29:53-05:00 DEBUG: VuFindSearch\Backend\Solr\Connector: Query fl=%2A&wt=json&json.nl=arrarr&q=id%3A%22irk-123456789-84913%22&qt=morelikethis&rows=5
2025-02-24T00:29:53-05:00 DEBUG: VuFindSearch\Backend\Solr\Connector: => GET http://localhost:8983/solr/biblio/select?fl=%2A&wt=json&json.nl=arrarr&q=id%3A%22irk-123456789-84913%22&qt=morelikethis&rows=5
2025-02-24T00:29:53-05:00 DEBUG: VuFindSearch\Backend\Solr\Connector: <= 200 OK
2025-02-24T00:29:53-05:00 DEBUG: Deserialized SOLR response
Решение блочных нелинейных задач оптимизации со связывающими переменными
Using of decomposition in variables is considered for nonlinear convex block problems with coordinating variables. There are described procedures for calculating of e-subgradient for functions of master problem. These procedures use approximate solutions of subproblems for individual blocks. Modific...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | Russian |
| Published: |
Інститут кібернетики ім. В.М. Глушкова НАН України
2004
|
| Series: | Теорія оптимальних рішень |
| Online Access: | http://dspace.nbuv.gov.ua/handle/123456789/84913 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | Using of decomposition in variables is considered for nonlinear convex block problems with coordinating variables. There are described procedures for calculating of e-subgradient for functions of master problem. These procedures use approximate solutions of subproblems for individual blocks. Modifications of well-known optimization methods are described. Results of numerical experiments are discussed. |
|---|