Остановите войну!
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 69 matches
- 2024
- Zeinab Alizadeh, Afrooz Jalilzadeh, Farzad Yousefian:
Randomized Lagrangian stochastic approximation for large-scale constrained stochastic Nash games. Optim. Lett. 18(2): 377-401 (2024) - Matan Atsmony, Gur Mosheiov:
Single machine scheduling to minimize maximum earliness/tardiness cost with job rejection. Optim. Lett. 18(3): 751-766 (2024) - Matteo Avolio, Antonio Fuduli:
The semiproximal SVM approach for multiple instance learning: a kernel-based computational study. Optim. Lett. 18(2): 635-649 (2024) - Abdennour Azerine, Mourad Boudhar, Djamal Rebaine:
On the complexity of proportionate open shop and job shop problems. Optim. Lett. 18(1): 365-375 (2024) - Maryam Bagherian:
Tensor denoising via dual Schatten norms. Optim. Lett. 18(5): 1285-1301 (2024) - Robert J. Baraldi, Drew P. Kouri:
Local convergence analysis of an inexact trust-region method for nonsmooth optimization. Optim. Lett. 18(3): 663-680 (2024) - Aleksandr Beznosikov, Martin Takác:
Random-reshuffled SARAH does not need full gradient computations. Optim. Lett. 18(3): 727-749 (2024) - Christian Biefel, Martin Schmidt:
On the relation between affinely adjustable robust linear complementarity and mixed-integer linear feasibility problems. Optim. Lett. 18(5): 1303-1311 (2024) - Pavel A. Borisovsky:
A parallel greedy approach enhanced by genetic algorithm for the stochastic rig routing problem. Optim. Lett. 18(1): 235-255 (2024) - Rafael Cação, Lucas R. C. T. Cortez, Jackson Forner, Hamidreza Validi, Ismael R. de Farias Jr., Illya V. Hicks:
The set partitioning problem in a quantum context. Optim. Lett. 18(1): 1-17 (2024) - Yifu Chen, Christos T. Maravelias, Xiaomin Zhang:
Tightening discretization-based MILP models for the pooling problem using upper bounds on bilinear terms. Optim. Lett. 18(1): 215-234 (2024) - Ashish Cherukuri:
Sample average approximation of conditional value-at-risk based variational inequalities. Optim. Lett. 18(2): 471-496 (2024) - Emilie Chouzenoux, Jean-Baptiste Fest:
Convergence analysis of block majorize-minimize subspace approach. Optim. Lett. 18(5): 1111-1130 (2024) - Ping-Fan Dai, Shi-Liang Wu:
A projected splitting method for vertical tensor complementarity problems. Optim. Lett. 18(4): 1005-1021 (2024) - Zsolt Darvay, Petra Renáta Rigó:
Interior-point algorithm for symmetric cone horizontal linear complementarity problems based on a new class of algebraically equivalent transformations. Optim. Lett. 18(2): 615-634 (2024) - Soumitra Dey, Vellaichamy Vetrivel, Hong-Kun Xu:
Well-posedness for the split equilibrium problem. Optim. Lett. 18(4): 977-989 (2024) - Krishnamurthy Dvijotham, Bala Krishnamoorthy, Yunqi Luo, Benjamin Rapone:
Robust feasibility of systems of quadratic equations using topological degree theory. Optim. Lett. 18(2): 591-613 (2024) - Yifu Feng, Xin-Na Geng, Dan-Yang Lv, Ji-Bo Wang:
Scheduling jobs with general linear deterioration to minimize total weighted number of late jobs. Optim. Lett. 18(5): 1217-1235 (2024) - Manlio Gaudioso, Giampaolo Liuzzi, Stefano Lucidi:
A clustering heuristic to improve a derivative-free algorithm for nonsmooth optimization. Optim. Lett. 18(1): 57-71 (2024) - Geovani Nunes Grapiglia:
Worst-case evaluation complexity of a derivative-free quadratic regularization method. Optim. Lett. 18(1): 195-213 (2024) - Bogdan Grechuk, Michael Zabarankin, Alexander Mafusalov, Stan Uryasev:
Buffered and Reduced Multidimensional Distribution Functions and Their Application in Optimization. Optim. Lett. 18(2): 403-426 (2024) - Dmitry V. Gribanov, Ivan A. Shumilov, Dmitriy S. Malyshev:
Structured $(\min ,+)$-convolution and its applications for the shortest/closest vector and nonlinear knapsack problems. Optim. Lett. 18(1): 73-103 (2024) - Benjamin Grimmer:
On optimal universal first-order methods for minimizing heterogeneous sums. Optim. Lett. 18(2): 427-445 (2024) - Feng Guo, Meijun Zhang:
An SDP method for fractional semi-infinite programming problems with SOS-convex polynomials. Optim. Lett. 18(1): 105-133 (2024) - Mansoureh Alavi Hejazi, Nooshin Movahedian:
On constraint qualifications and optimality conditions for robust optimization problems through pseudo-differential. Optim. Lett. 18(3): 705-726 (2024) - Shaotao Hu, Yuanheng Wang, Ping Jing, Qiao-Li Dong:
Strong convergence theorem for a new Bregman extragradient method with a different line-search process for solving variational inequality problems in reflexive Banach spaces. Optim. Lett. 18(3): 783-801 (2024) - Queenie Yingkun Huang, Vaithilingam Jeyakumar:
A distributional Farkas' lemma and moment optimization problems with no-gap dual semi-definite programs. Optim. Lett. 18(5): 1095-1110 (2024) - Lidia Huerga, Enrico Miglierina, Elena Molho, Vicente Novo:
On proper minimality in set optimization. Optim. Lett. 18(2): 513-528 (2024) - Anastasia Ivanova, Roland Hildebrand:
Optimal step length for the maximal decrease of a self-concordant function by the Newton method. Optim. Lett. 18(3): 847-854 (2024) - Seulgi Joung:
A new sequential lifting of robust cover inequalities. Optim. Lett. 18(4): 925-941 (2024)
skipping 39 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-15 14:35 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