Wyszukiwanie zaawansowane ?

Obiekt

Pobierz

Tytuł: Some variant sof projection methods for large nonlinear optimization problems, Journal of Telecommunications and Information Technology, 2003, nr 3

Autor:

Białoń, Paweł

Data wydania:

2003, nr 3

Typ zasobu:

artykuł

Opis:

Two ideas of modifying projection methods for the case of smooth nonlinear optimization are presented. Projection methods were originally successfully used in solving largescale linear feasibility problems. The proposed instantiations of projection methods fall into two groups. One of them is a decomposition approach in which projections onto sets are realized as optimization problems which themselves involve much portions of original problem constraints. There are two subproblems: one build with linear constraints of the original problem and the second one build with original nonlinear constraints. These approaches use special accelerating cuts so that the separation of nonlinear and linear constraints can be effective and some problem sparsity preserved. The second group bases on penalty-shifting/multiplier methods and draws from the observation that unconstrained subproblems obtained there may solve very slowly due to their nonsmooth character. Thus it is proposed to solve them with modified projection methods which inherit from conjugate gradient methodsa multi-dimensional subspace in one epoche.

Wydawca:

Instytut Łączności - Państwowy Instytut Badawczy, Warszawa

Format:

application/pdf

Identyfikator zasobu:

oai:bc.itl.waw.pl:605 ; ISSN 1509-4553, on-line: ISSN 1899-8852

DOI:

10.26636/jtit.2003.3.192

ISSN:

1509-4553

eISSN:

1899-8852

Źródło:

Journal of Telecommunications and Information Technology

Język:

ang

Prawa:

Biblioteka Naukowa Instytutu Łączności

Temat i słowa kluczowe:

penalty shifting method projection methods non-linear optimization

Kolekcje, do których przypisany jest obiekt:

Data ostatniej modyfikacji:

29 maj 2024

Data dodania obiektu:

22 mar 2010

Liczba wyświetleń treści obiektu:

144

Wszystkie dostępne wersje tego obiektu:

https://bc.itl.waw.pl/publication/674

Wyświetl opis w formacie RDF:

RDF

Wyświetl opis w formacie OAI-PMH:

OAI-PMH

Nazwa wydania Data
Białoń, Paweł, Some variant sof projection methods for large nonlinear optimization problems, Journal of Telecommunications and Information Technology, 2003, nr 3 29 maj 2024

Obiekty Podobne
A proposition to exploit the partially linear structure of the nonlinear multicommodity flow optimization problem, Journal of Telecommunications and Information Technology, 2002, nr 3

Białoń, Paweł M.

2002, nr 3
artykuł
A Practical Approach to Tra#14;c Engineering using an Unsplittable Multicommodity Flow Problem with QoS Constraints, Journal of Telecommunications and Information Technology, 2016, nr 3

Białoń, Paweł

2016, nr 3
artykuł
2023, nr 4, JTIT-artykuły
2023, nr 4, JTIT-artykuły
A Problem of Detecting Stops While Tracking Moving Objects Under the Stream Processing Regime, Journal of Telecommunications and Information Technology, 2023, nr 4

Białoń, Paweł

2023
artykuł
An Eclectic Approach to Network Service Failure Detection Based on Multicriteria Analysis with an Exampleof Mixing Probabilistic Context Free Grammar Models, Journal of Telekommunications and Information Technology, 2008, nr 4

Białoń, Paweł

2008, nr 4
artykuł
Solving Support Vector Machine with Many Examples, Journal of Telecommunications and Information Technology, 2010, nr 3

Białoń, Paweł

2010, nr 3
artykuł
Problems of Broadband in Rural Areas in Light of the BReATH Project Experiences, Journal of Telecommunications and Information Technology, 2008, nr 4

Białoń, Paweł

2008, nr 4
artykuł
An Online Stream Monitoring Algorithm for Fraud Detection in the Transport of Goods, Journal of Telecommunications and Information Technology, 2020, nr 4

Białoń, Paweł M.

2020, nr 4
artykuł
Więcej
×

Cytowanie

Styl cytowania:

Dane kontaktowe

Adres

Instytut Łączności – Państwowy Instytut Badawczy ul. Szachowa 1 04-894 Warszawa

Telefon

(+48) 5128 696

E-Mail

biblioteka@il-pib.pl

Odwiedź nas!

Ta strona wykorzystuje pliki 'cookies'. Więcej informacji