Остановите войну!
for scientists:
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 59 matches
- 2020
- Azam Asl, Michael L. Overton:
Analysis of the gradient method with an Armijo-Wolfe line search on a class of non-smooth convex functions. Optim. Methods Softw. 35(2): 223-242 (2020) - Masoud Ataei, Shengyuan Chen, Zijiang Yang, M. Reza Peyghami:
Time-homogeneous top-K ranking using tensor decompositions. Optim. Methods Softw. 35(6): 1119-1143 (2020) - Albert S. Berahas, Raghu Bollapragada, Jorge Nocedal:
An investigation of Newton-Sketch and subsampled Newton methods. Optim. Methods Softw. 35(4): 661-680 (2020) - Albert S. Berahas, Martin Takác:
A robust multi-batch L-BFGS method for machine learning. Optim. Methods Softw. 35(1): 191-219 (2020) - David E. Bernal, Stefan Vigerske, Francisco Trespalacios, Ignacio E. Grossmann:
Improving the performance of DICOPT in convex MINLP problems using a feasibility pump. Optim. Methods Softw. 35(1): 171-190 (2020) - Ernesto G. Birgin, José Mario Martínez:
Complexity and performance of an Augmented Lagrangian algorithm. Optim. Methods Softw. 35(5): 885-920 (2020) - Robert Burlacu, Björn Geißler, Lars Schewe:
Solving mixed-integer nonlinear programmes using adaptively refined mixed-integer linear programmes. Optim. Methods Softw. 35(1): 37-64 (2020) - Coralia Cartis, Nick I. M. Gould, Philippe L. Toint:
A concise second-order complexity analysis for unconstrained optimization using high-order regularized models. Optim. Methods Softw. 35(2): 243-256 (2020) - Byoung Jin Choi, Un Cig Ji, Yongdo Lim:
Convex feasibility problems on uniformly convex metric spaces. Optim. Methods Softw. 35(1): 21-36 (2020) - Emre Çimen, Gürkan Öztürk:
O-PCF algorithm for one-class classification. Optim. Methods Softw. 35(6): 1065-1079 (2020) - Christian Clason, Yu Deng, Patrick Mehlitz, Uwe Prüfert:
Optimal control problems with control complementarity constraints: existence results, optimality conditions, and a penalty method. Optim. Methods Softw. 35(1): 142-170 (2020) - Yu-Hong Dai, Florian Jarre, Felix Lieder:
On the existence of affine invariant descent directions. Optim. Methods Softw. 35(5): 938-954 (2020) - Yu-Hong Dai, Xin Liu, Jiawang Nie, Zaiwen Wen:
Preface. Optim. Methods Softw. 35(2): 221-222 (2020) - Ioannis C. Demetriou:
Separation theorems for the extrema of best piecewise monotonic approximations to successive data. Optim. Methods Softw. 35(3): 439-459 (2020) - Maxim V. Dolgopolik:
The method of codifferential descent for convex and global piecewise affine optimization. Optim. Methods Softw. 35(6): 1191-1222 (2020) - Jennifer B. Erway, Joshua D. Griffin, Roummel F. Marcia, Riadh Omheni:
Trust-region algorithms for training responses: machine learning methods using indefinite Hessian approximations. Optim. Methods Softw. 35(3): 460-487 (2020) - Jinyan Fan, Jiawang Nie, Ruixue Zhao:
The maximum tensor complementarity eigenvalues. Optim. Methods Softw. 35(6): 1179-1190 (2020) - Patrick E. Farrell, Matteo Croci, Thomas M. Surowiec:
Deflation for semismooth equations. Optim. Methods Softw. 35(6): 1248-1271 (2020) - Daniele Ferone, Paola Festa, Francesca Guerriero:
An efficient exact approach for the constrained shortest path tour problem. Optim. Methods Softw. 35(1): 1-20 (2020) - Ivet L. Galabova, J. A. J. Hall:
The 'Idiot' crash quadratic penalty algorithm for linear programming and its application to linearizations of quadratic assignment problems. Optim. Methods Softw. 35(3): 488-501 (2020) - Giulio Galvan, Matteo Lapucci, Tommaso Levato, Marco Sciandrone:
An Alternating Augmented Lagrangian method for constrained nonconvex optimization. Optim. Methods Softw. 35(3): 502-520 (2020) - Wenbo Gao, Donald Goldfarb, Frank E. Curtis:
ADMM for multiaffine constrained optimization. Optim. Methods Softw. 35(2): 257-303 (2020) - Nicholas I. M. Gould, Valeria Simoncini:
Error estimates for iterative algorithms for minimizing regularized quadratic subproblems. Optim. Methods Softw. 35(2): 304-328 (2020) - Warren L. Hare, Chayne Planiden, Claudia A. Sagastizábal:
A derivative-free VU-algorithm for convex finite-max problems. Optim. Methods Softw. 35(3): 521-559 (2020) - Tamir Hazan, Shoham Sabach, Sergey Voldman:
Stochastic proximal linear method for structured non-convex problems. Optim. Methods Softw. 35(5): 921-937 (2020) - Lisa C. Hegerhorst-Schultchen, Christian Kirches, Marc Christian Steinbach:
On the relation between MPECs and optimization problems in abs-normal form. Optim. Methods Softw. 35(3): 560-575 (2020) - Michael Hintermüller, Nikolai Strogies:
Identification of the friction function in a semilinear system for gas transport through a network. Optim. Methods Softw. 35(3): 576-617 (2020) - Yakui Huang, Yu-Hong Dai, Xinwei Liu, Hongchao Zhang:
Gradient methods exploiting spectral properties. Optim. Methods Softw. 35(4): 681-705 (2020) - Zeyu Jia, Zaiwen Wen, Yinyu Ye:
Towards solving 2-TBSG efficiently. Optim. Methods Softw. 35(4): 706-721 (2020) - Radek Kucera, Kristina Motycková, Alexandros Markopoulos, Jaroslav Haslinger:
On the inexact symmetrized globally convergent semi-smooth Newton method for 3D contact problems with Tresca friction: the R-linear convergence rate. Optim. Methods Softw. 35(1): 65-86 (2020)
skipping 29 more matches
loading more results
failed to load more results, please try again later
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-06-22 10:43 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint