Остановите войну!
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 32 matches
- 2023
- Ciwen Chen, Guyan Ni, Bo Yang:
Partially symmetric tensor structure preserving rank-R approximation via BFGS algorithm. Comput. Optim. Appl. 85(2): 621-652 (2023) - Wang Chen, Xinmin Yang, Yong Zhao:
Conditional gradient method for vector optimization. Comput. Optim. Appl. 85(3): 857-896 (2023) - Hong T. M. Chu, Ling Liang, Kim-Chuan Toh, Lei Yang:
An efficient implementable inexact entropic proximal point algorithm for a class of linear programming problems. Comput. Optim. Appl. 85(1): 107-146 (2023) - Maxim V. Dolgopolik:
DC semidefinite programming and cone constrained DC optimization II: local search methods. Comput. Optim. Appl. 85(3): 993-1031 (2023) - Guillaume Erbs, Clara Lage, Claudia A. Sagastizábal, Mikhail V. Solodov:
Increasing reliability of price signals in long term energy management problems. Comput. Optim. Appl. 85(3): 787-820 (2023) - Giulia Ferrandi, Michiel E. Hochstenbach, Natasa Krejic:
A harmonic framework for stepsize selection in gradient methods. Comput. Optim. Appl. 85(1): 75-106 (2023) - Ying Gao, Wenxing Zhang:
An alternative extrapolation scheme of PDHGM for saddle point problem with nonlinear function. Comput. Optim. Appl. 85(1): 263-291 (2023) - Ubaldo M. García-Palomares:
Convergence of derivative-free nonmonotone Direct Search Methods for unconstrained and box-constrained mixed-integer optimization. Comput. Optim. Appl. 85(3): 821-856 (2023) - Geovani Nunes Grapiglia:
Quadratic regularization methods with finite-difference gradient approximations. Comput. Optim. Appl. 85(3): 683-703 (2023) - Yan Gu, Jianlin Jiang, Shun Zhang:
Distributionally robust Weber problem with uncertain demand. Comput. Optim. Appl. 85(3): 705-752 (2023) - Erfan Yazdandoost Hamedani, Afrooz Jalilzadeh:
A stochastic variance-reduced accelerated primal-dual method for finite-sum saddle-point problems. Comput. Optim. Appl. 85(2): 653-679 (2023) - Masoumeh Hashemi, Roland Herzog, Thomas M. Surowiec:
Optimal control of the stationary Kirchhoff equation. Comput. Optim. Appl. 85(2): 479-508 (2023) - Wen Huang, Ke Wei:
An inexact Riemannian proximal gradient method. Comput. Optim. Appl. 85(1): 1-32 (2023) - Alexey F. Izmailov, Mikhail V. Solodov:
Convergence rate estimates for penalty methods revisited. Comput. Optim. Appl. 85(3): 973-992 (2023) - Zhen-Yuan Ji, Yu-Hong Dai:
Greedy PSB methods with explicit superlinear convergence. Comput. Optim. Appl. 85(3): 753-786 (2023) - Christian Kanzow, Matteo Lapucci:
Inexact penalty decomposition methods for optimization problems with geometric constraints. Comput. Optim. Appl. 85(3): 937-971 (2023) - Weiwei Kong, Renato D. C. Monteiro:
An accelerated inexact dampened augmented Lagrangian method for linearly-constrained nonconvex composite optimization problems. Comput. Optim. Appl. 85(2): 509-545 (2023) - Drew P. Kouri, Mathias Staudigl, Thomas M. Surowiec:
A relaxation-based probabilistic approach for PDE-constrained optimization under uncertainty with pointwise state constraints. Comput. Optim. Appl. 85(2): 441-478 (2023) - Natasa Krejic, Greta Malaspina, Lense Swaenen:
A split Levenberg-Marquardt method for large-scale sparse problems. Comput. Optim. Appl. 85(1): 147-179 (2023) - Matteo Lapucci, Pierluigi Mansueto:
A limited memory Quasi-Newton approach for multi-objective optimization. Comput. Optim. Appl. 85(1): 33-73 (2023) - Johannes von Lindheim:
Simple approximative algorithms for free-support Wasserstein barycenters. Comput. Optim. Appl. 85(1): 213-246 (2023) - Yong-Jin Liu, Jing Yu:
A semismooth Newton based dual proximal point algorithm for maximum eigenvalue problem. Comput. Optim. Appl. 85(2): 547-582 (2023) - Kaiwen Ma, Luis Miguel Rios, Atharv Bhosekar, Nikolaos V. Sahinidis, Sreekanth Rajagopalan:
Branch-and-Model: a derivative-free global optimization algorithm. Comput. Optim. Appl. 85(2): 337-367 (2023) - Robert Mohr, Maximilian Coblenz, Peter Kirst:
Globally optimal univariate spline approximations. Comput. Optim. Appl. 85(2): 409-439 (2023) - Hiroyuki Sato:
Riemannian optimization on unit sphere with p-norm and its applications. Comput. Optim. Appl. 85(3): 897-935 (2023) - Johannes Schmidt, Armin Fügenschuh:
A two-time-level model for mission and flight planning of an inhomogeneous fleet of unmanned aerial vehicles. Comput. Optim. Appl. 85(1): 293-335 (2023) - Shuqin Sun, Ting Kei Pong:
Doubly iteratively reweighted algorithm for constrained compressed sensing models. Comput. Optim. Appl. 85(2): 583-619 (2023) - Saravanan Venkatachalam, Lewis Ntaimo:
Integer set reduction for stochastic mixed-integer programming. Comput. Optim. Appl. 85(1): 181-211 (2023) - Lei Wang, Xin Liu, Yin Zhang:
A communication-efficient and privacy-aware distributed algorithm for sparse PCA. Comput. Optim. Appl. 85(3): 1033-1072 (2023) - Zhijun Xu, Jing Zhou:
A simultaneous diagonalization based SOCP relaxation for portfolio optimization with an orthogonality constraint. Comput. Optim. Appl. 85(1): 247-261 (2023)
skipping 2 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-05-29 12:42 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