Остановите войну!
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 33 matches
- 2019
- Wim van Ackooij, Welington de Oliveira, Yongjia Song:
On level regularization with normal solutions in decomposition methods for multistage stochastic programming problems. Comput. Optim. Appl. 74(1): 1-42 (2019) - Lori Badea:
Additive and restricted additive Schwarz-Richardson methods for inequalities with nonlinear monotone operators. Comput. Optim. Appl. 74(2): 345-385 (2019) - Jifeng Bao, Carisa Kwok Wai Yu, Jinhua Wang, Yaohua Hu, Jen-Chih Yao:
Modified inexact Levenberg-Marquardt methods for solving nonlinear least squares problems. Comput. Optim. Appl. 74(2): 547-582 (2019) - Johannes Brust, Oleg Burdakov, Jennifer B. Erway, Roummel F. Marcia:
A dense initialization for limited-memory quasi-Newton methods. Comput. Optim. Appl. 74(1): 121-142 (2019) - Johannes Brust, Roummel F. Marcia, Cosmin G. Petra:
Large-scale quasi-Newton trust-region methods with low-dimensional linear equality constraints. Comput. Optim. Appl. 74(3): 669-701 (2019) - Árpád Bürmen, Iztok Fajfar:
Mesh adaptive direct search with simplicial Hessian update. Comput. Optim. Appl. 74(3): 645-667 (2019) - Enzo Busseti, Walaa M. Moursi, Stephen P. Boyd:
Solution refinement at regular points of conic problems. Comput. Optim. Appl. 74(3): 627-643 (2019) - Norberto Castillo-García, Paula Hernández Hernández:
Two new integer linear programming formulations for the vertex bisection problem. Comput. Optim. Appl. 74(3): 895-918 (2019) - Wanchun Chen, Wenhao Du, William W. Hager, Liang Yang:
Bounds for integration matrices that arise in Gauss and Radau collocation. Comput. Optim. Appl. 74(1): 259-273 (2019) - Yiran Cui, Keiichi Morikuni, Takashi Tsuchiya, Ken Hayami:
Implementation of interior-point methods for LP based on Krylov subspace iterative solvers with inner-iteration preconditioning. Comput. Optim. Appl. 74(1): 143-176 (2019) - Yu-Hong Dai, Yakui Huang, Xinwei Liu:
A family of spectral gradient methods for optimization. Comput. Optim. Appl. 74(1): 43-65 (2019) - Paola Festa, Francesca Guerriero, Antonio Napoletano:
An auction-based approach for the re-optimization shortest path tree problem. Comput. Optim. Appl. 74(3): 851-893 (2019) - Leonardo Di Gangi, Matteo Lapucci, Fabio Schoen, Alessio Sortino:
An efficient optimization approach for best subset selection in linear regression, with application to model selection and fitting in autoregressive time-series. Comput. Optim. Appl. 74(3): 919-948 (2019) - Jacek Gondzio, F. N. C. Sobral:
Quasi-Newton approaches to interior point methods for quadratic problems. Comput. Optim. Appl. 74(1): 93-120 (2019) - William W. Hager, Hongyan Hou, Subhashree Mohapatra, Anil V. Rao, Xiang-Sheng Wang:
Convergence rate for a Radau hp collocation method applied to constrained optimal control. Comput. Optim. Appl. 74(1): 275-314 (2019) - William W. Hager, Hongyan Hou, Subhashree Mohapatra, Anil V. Rao, Xiang-Sheng Wang:
Correction to: Convergence rate for a Radau hp collocation method applied to constrained optimal control. Comput. Optim. Appl. 74(1): 315-316 (2019) - Dusan Jakovetic, Natasa Krejic, Natasa Krklec Jerinkic:
Exact spectral-like gradient method for distributed optimization. Comput. Optim. Appl. 74(3): 703-728 (2019) - Aswin Kannan, Uday V. Shanbhag:
Optimal stochastic extragradient schemes for pseudomonotone stochastic variational inequality problems and their variants. Comput. Optim. Appl. 74(3): 779-820 (2019) - Hikaru Komeiji, Sunyoung Kim, Makoto Yamashita:
On the conditions for the finite termination of ADMM and its applications to SOS polynomials feasibility problems. Comput. Optim. Appl. 74(2): 317-344 (2019) - Jae Hwa Lee, Yoon Mo Jung, Ya-Xiang Yuan, Sangwoon Yun:
A subspace SQP method for equality constrained optimization. Comput. Optim. Appl. 74(1): 177-194 (2019) - Harry Fernando Oviedo Leon:
A delayed weighted gradient method for strictly convex quadratic minimization. Comput. Optim. Appl. 74(3): 729-746 (2019) - Jingqun Li, Ratnasingham Tharmarasa, Daly Brown, Thia Kirubarajan, Krishna R. Pattipati:
A novel convex dual approach to three-dimensional assignment problem: theoretical analysis. Comput. Optim. Appl. 74(2): 481-516 (2019) - Dirk A. Lorenz, Quoc Tran-Dinh:
Non-stationary Douglas-Rachford and alternating direction method of multipliers: adaptive step-sizes and convergence. Comput. Optim. Appl. 74(1): 67-92 (2019) - Pedro Merino:
A difference-of-convex functions approach for sparse PDE optimal control problems with nonconvex costs. Comput. Optim. Appl. 74(1): 225-258 (2019) - Najmeh Hoseini Monjezi, S. Nobakhtian:
A new infeasible proximal bundle algorithm for nonsmooth nonconvex constrained optimization. Comput. Optim. Appl. 74(2): 443-480 (2019) - Xiaolong Qin, Nguyen Thai An:
Smoothing algorithms for computing the projection onto a Minkowski sum of convex sets. Comput. Optim. Appl. 74(3): 821-850 (2019) - Ernest K. Ryu, Yanli Liu, Wotao Yin:
Douglas-Rachford splitting and ADMM for pathological convex optimization. Comput. Optim. Appl. 74(3): 747-778 (2019) - Chee-Khian Sim:
Interior point method on semi-definite linear complementarity problems using the Nesterov-Todd (NT) search direction: polynomial complexity and local convergence. Comput. Optim. Appl. 74(2): 583-621 (2019) - Akram Taati, Maziar Salahi:
A conjugate gradient-based algorithm for large-scale quadratic programming problem with one quadratic constraint. Comput. Optim. Appl. 74(1): 195-223 (2019) - Ron Teller, Moshe Zofi, Moshe Kaspi:
Minimizing the average searching time for an object within a graph. Comput. Optim. Appl. 74(2): 517-545 (2019)
skipping 3 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-10 13:37 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