Остановите войну!
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 42 matches
- 2023
- Adeyemi D. Adeoye, Alberto Bemporad:
SCORE: approximating curvature information under self-concordant regularization. Comput. Optim. Appl. 86(2): 599-626 (2023) - Samir Adly, Hédy Attouch, Manh Hung Le:
First order inertial optimization algorithms with threshold effects associated with dry friction. Comput. Optim. Appl. 86(3): 801-843 (2023) - Shun Arahata, Takayuki Okuno, Akiko Takeda:
Complexity analysis of interior-point methods for second-order stationary points of nonlinear semidefinite optimization problems. Comput. Optim. Appl. 86(2): 555-598 (2023) - Francisco J. Aragón Artacho, Yura Malitsky, Matthew K. Tam, David Torregrosa-Belén:
Distributed forward-backward methods for ring networks. Comput. Optim. Appl. 86(3): 845-870 (2023) - Zvi Artstein:
Linear singularly perturbed systems without slow-fast split. Comput. Optim. Appl. 86(3): 871-884 (2023) - Robert Baier, Elza M. Farkhi:
A Filippov approximation theorem for strengthened one-sided Lipschitz differential inclusions. Comput. Optim. Appl. 86(3): 885-923 (2023) - Letícia Becher, Damián R. Fernández, Alberto Ramos:
A trust-region LP-Newton method for constrained nonsmooth equations under Hölder metric subregularity. Comput. Optim. Appl. 86(2): 711-743 (2023) - Albert S. Berahas, Jiahao Shi, Zihong Yi, Baoyu Zhou:
Accelerating stochastic sequential quadratic programming for equality constrained optimization using predictive variance reduction. Comput. Optim. Appl. 86(1): 79-116 (2023) - Nina Beranek, Martin Alexander Reinhold, Karsten Urban:
A space-time variational method for optimal control problems: well-posedness, stability and numerical solution. Comput. Optim. Appl. 86(2): 767-794 (2023) - Radu Ioan Bot, Ernö Robert Csetnek, Michael Sedlmayer:
An accelerated minimax algorithm for convex-concave saddle point problems with nonsmooth coupling function. Comput. Optim. Appl. 86(3): 925-966 (2023) - Cecilia Orellana Castro, Manolo Rodriguez Heredia, Aurelio R. L. Oliveira:
Recycling basic columns of the splitting preconditioner in interior point methods. Comput. Optim. Appl. 86(1): 49-78 (2023) - Jeffrey Christiansen, Brian C. Dandurand, Andrew C. Eberhard, Fabricio Oliveira:
A study of progressive hedging for stochastic integer programming. Comput. Optim. Appl. 86(3): 989-1034 (2023) - Alberto Domínguez Corella, Nicolai Jork, Vladimir M. Veliov:
On the solution stability of parabolic optimal control problems. Comput. Optim. Appl. 86(3): 1035-1079 (2023) - Kuangyu Ding, Xin Yee Lam, Kim-Chuan Toh:
On proximal augmented Lagrangian based decomposition methods for dual block-angular convex composite programming problems. Comput. Optim. Appl. 86(1): 117-161 (2023) - Gabriele Eichfelder, Lars Grüne, Lisa Krügel, Jonas Schießl:
Relaxed dissipativity assumptions and a simplified algorithm for multiobjective MPC. Comput. Optim. Appl. 86(3): 1081-1116 (2023) - David Ek, Anders Forsgren:
A structured modified Newton approach for solving systems of nonlinear equations arising in interior-point methods for quadratic programming. Comput. Optim. Appl. 86(1): 1-48 (2023) - Manlio Gaudioso, Giovanni Giallombardo, Giovanna Miglionico:
Sparse optimization via vector k-norm and DC programming with an application to feature selection for support vector machines. Comput. Optim. Appl. 86(2): 745-766 (2023) - Helmut Gfrerer, Alexander Y. Kruger:
Radius theorems for subregularity in infinite dimensions. Comput. Optim. Appl. 86(3): 1117-1158 (2023) - Helmut Gfrerer, Michael Mandlmayr, Jirí V. Outrata, Jan Valdman:
On the SCD semismooth* Newton method for generalized equations with application to a class of static contact problems with Coulomb friction. Comput. Optim. Appl. 86(3): 1159-1191 (2023) - Shaoyan Guo, Hou-Duo Qi, Liwei Zhang:
Perturbation analysis of the euclidean distance matrix optimization problem and its numerical implications. Comput. Optim. Appl. 86(3): 1193-1227 (2023) - William W. Hager:
Extension of switch point algorithm to boundary-value problems. Comput. Optim. Appl. 86(3): 1229-1246 (2023) - William W. Hager, R. Tyrrell Rockafellar, Vladimir M. Veliov:
Preface to Asen L. Dontchev Memorial Special Issue. Comput. Optim. Appl. 86(3): 795-800 (2023) - Qing-Rui He, Chun-Rong Chen, Sheng-Jie Li:
Spectral conjugate gradient methods for vector optimization problems. Comput. Optim. Appl. 86(2): 457-489 (2023) - Baohua Huang, Wen Li:
A smoothing Newton method based on the modulus equation for a class of weakly nonlinear complementarity problems. Comput. Optim. Appl. 86(1): 345-381 (2023) - C. Yalçin Kaya, Helmut Maurer:
Optimization over the Pareto front of nonconvex multi-objective optimal control problems. Comput. Optim. Appl. 86(3): 1247-1274 (2023) - Shaoze Li, Zhibin Deng, Cheng Lu, Junhao Wu, Jinyu Dai, Qiao Wang:
An efficient global algorithm for indefinite separable quadratic knapsack problems with box constraints. Comput. Optim. Appl. 86(1): 241-273 (2023) - Jiaming Liang, Renato D. C. Monteiro:
Average curvature FISTA for nonconvex smooth composite optimization problems. Comput. Optim. Appl. 86(1): 275-302 (2023) - Gui-Hua Lin, Zhen-Ping Yang, Haian Yin, Jin Zhang:
A dual-based stochastic inexact algorithm for a class of stochastic nonsmooth convex composite problems. Comput. Optim. Appl. 86(2): 669-710 (2023) - Tianxiang Liu, Ting Kei Pong, Akiko Takeda:
Doubly majorized algorithm for sparsity-inducing optimization problems with regularizer-compatible constraints. Comput. Optim. Appl. 86(2): 521-553 (2023) - Ziyan Luo, Liqun Qi:
Optimality conditions for Tucker low-rank tensor optimization. Comput. Optim. Appl. 86(3): 1275-1298 (2023)
skipping 12 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 22:48 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