default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDOptimization Methods and Software, Volume 36
Volume 36, Number 1, 2021
- Yekini Shehu, Phan Tu Vuong
, Alain B. Zemkoho:
An inertial extrapolation method for convex simple bilevel optimization. 1-19 - Chenxin Ma, Martin Jaggi, Frank E. Curtis, Nathan Srebro, Martin Takác:
An accelerated communication-efficient primal-dual optimization framework for structured machine learning. 20-44 - Alberto Ramos:
Mathematical programs with equilibrium constraints: a sequential optimality condition, new constraint qualifications and algorithmic consequences. 45-81 - Habib ur Rehman, Poom Kumam, Yeol Je Cho, Yusuf I. Suleiman, Wiyada Kumam:
Modified Popov's explicit iterative algorithms for solving pseudomonotone equilibrium problems. 82-113 - Nikolaus Hansen, Anne Auger, Raymond Ros, Olaf Mersmann, Tea Tusar, Dimo Brockhoff:
COCO: a platform for comparing continuous optimizers in a black-box setting. 114-144 - Geovani Nunes Grapiglia, Yurii E. Nesterov:
On inexact solution of auxiliary problems in tensor methods for convex optimization. 145-170 - César A. Uribe, Soomin Lee, Alexander V. Gasnikov, Angelia Nedic:
A dual approach for optimal algorithms in distributed optimization over networks. 171-210 - Vincent Guigues:
Multistage stochastic programs with a random number of stages: dynamic programming equations, solution methods, and application to portfolio selection. 211-236 - Lam M. Nguyen, Katya Scheinberg, Martin Takác:
Inexact SARAH algorithm for stochastic optimization. 237-258
Volume 36, Numbers 2-3, 2021
- Takashi Tsuchiya, Kokichi Sugihara:
Preface. 259-261 - Kazutoshi Ando, Satoru Fujishige:
Signed ring families and signed posets. 262-278 - David Avis, Charles Jordan:
mts: a light framework for parallelizing tree search codes. 279-300 - Andreas Griewank, Tom Streubel, Caren Tischendorf:
On the abs-polynomial expansion of piecewise smooth functions. 301-315 - Yuya Higashikawa, Keiko Imai, Takeharu Shiraga, Noriyoshi Sukegawa, Yusuke Yokosuka:
Minimum point-overlap labelling. 316-325 - Hiroshi Imai, Keiko Imai, Hidefumi Hiraishi:
Extended formulations of lower-truncated transversal polymatroids. 326-331 - Satoru Iwata:
A Pfaffian formula for matching polynomials of outerplanar graphs. 332-336 - Joaquim João Júdice, Masao Fukushima, Alfredo N. Iusem, José Mario Martínez, Valentina Sessa:
An alternating direction method of multipliers for the eigenvalue complementarity problem. 337-370 - Sunyoung Kim, Masakazu Kojima, Kim-Chuan Toh:
A Newton-bracketing method for a simple conic optimization problem. 371-388 - Tianyi Lin, Shiqian Ma, Yinyu Ye, Shuzhong Zhang:
An ADMM-based interior-point method for large-scale linear programming. 389-424 - Bruno F. Lourenço, Masakazu Muramatsu, Takashi Tsuchiya:
Solving SDP completely with an interior point oracle. 425-471 - Kazuo Murota:
A survey of fundamental operations on discrete convex functions of various kinds. 472-518 - Kazuo Murota:
On basic operations related to network induction of discrete convex functions. 519-559 - András Recski:
Applications of matroids in electric network theory. 560-568 - Hiroshi Yamashita, Hiroshi Yabe, Kouhei Harada:
A primal-dual interior point trust-region method for nonlinear semidefinite programming. 569-601 - Weifeng Zhong, Qun Lin, Ryan C. Loxton, Kok Lay Teo:
Optimal train control via switched system dynamic optimization. 602-626 - Mehrdad Ghaznavi, Fereshteh Akbari, Esmaile Khorram:
Optimality conditions via a unified direction approach for (approximate) efficiency in multiobjective optimization. 627-652 - Liping Tang, Xinmin Yang:
A modified direction approach for proper efficiency of multiobjective optimization. 653-668
- Correction. 669
Volume 36, Number 4, July 2021
- Milojica Jacimovic, Mikhail Yu. Khachay, Yury Kochetov, Mikhail Posypkin:
Preface. 671 - Oleg Zaikin, Stepan Kochemazov:
On black-box optimization in divide-and-conquer SAT solving. 672-696 - Roman V. Plotnikov, Adil I. Erzin, Vyacheslav V. Zalyubovskiy:
GLS and VNS based heuristics for conflict-free minimum-latency aggregation scheduling in WSN. 697-719 - Anastasiya Ivanova, Pavel E. Dvurechensky, Alexander V. Gasnikov, Dmitry Kamzolov:
Composite optimization for the resource allocation problem. 720-754 - Van-Huy Pham, Kien Trung Nguyen, Tran Thu Le:
Inverse stable point problem on trees under an extension of Chebyshev norm and Bottleneck Hamming distance. 755-772 - Yurii E. Nesterov, Alexander V. Gasnikov, Sergey Guminov, Pavel E. Dvurechensky:
Primal-dual accelerated gradient methods with small-dimensional relaxation oracle. 773-810 - Olga Brezhneva, Yuri G. Evtushenko, Alexey Tret'yakov:
New perspective on some classical results in analysis and optimization. 811-820 - Ilya Chernykh, Ekaterina Lgotina:
Two-machine routing open shop on a tree: instance reduction and efficiently solvable subclass. 821-841 - Valentin R. Koch, Hung M. Phan:
Optimization of triangular networks with spatial constraints. 842-868 - David W. Juedes, Jeffrey Jones:
A generic framework for approximation analysis of greedy algorithms for star bicoloring. 869-890
Volume 36, Number 5, September 2021
- G. Battulga, L. Altangerel, G. Battur:
Loan interest rate Nash models with solvency constraints in the banking sector. 891-908 - Torsten Falko Bosse, Sri Hari Krishna Narayanan:
Study of the numerical efficiency of structured abs-normal forms. 909-933 - Javier Peña, Negar Soheili:
Computational performance of a projection and rescaling algorithm. 934-951 - Victor Gergel, Alexey Goryachih:
Multidimensional global optimization using numerical estimates of objective function derivatives. 952-972 - Parvin Nazari, Esmaile Khorram, Davoud Ataee Tarzanagh:
Adaptive online distributed optimization in dynamic environments. 973-997 - Branislav Ivanov, Predrag S. Stanimirovic, Gradimir V. Milovanovic, Snezana Djordjevic, Ivona Brajevic:
Accelerated multiple step-size methods for solving unconstrained optimization problems. 998-1029 - Pedro Hespanhol, Rien Quirynen:
Adjoint-based SQP method with block-wise quasi-Newton Jacobian updates for nonlinear optimal control. 1030-1058 - Mostafa Rezapour, Thomas J. Asaki:
Adaptive trust-region algorithms for unconstrained optimization. 1059-1081 - Sergey I. Bastrakov, Andrey Churkin, Nikolai Yu. Zolotykh:
Accelerating Fourier-Motzkin elimination using bit pattern trees. 1082-1095
Volume 36, Number 6, November 2021
- Oleg Khamisov, Anton V. Eremeev, Vladimir Ushakov:
Preface to the special issue. 1097-1098 - Ovanes L. Petrosian, Anna V. Tur, Zeyang Wang, Hongwei Gao:
Cooperative differential games with continuous updating using Hamilton-Jacobi-Bellman equation. 1099-1127 - Yaroslav V. Salii, Andrey S. Sheka:
Improving dynamic programming for travelling salesman with precedence constraints: parallel Morin-Marsten bounding. 1128-1154 - Fedor S. Stonyakin, Alexander Tyurin, Alexander V. Gasnikov, Pavel E. Dvurechensky, Artem Agafonov, Darina Dvinskikh, Mohammad S. Alkousa, Dmitry Pasechnyuk, Sergei Artamonov, Victoria V. Piskunova:
Inexact model: a framework for optimization and variational inequalities. 1155-1201 - Olivier Fercoq:
A generic coordinate descent solver for non-smooth convex optimisation. 1202-1222 - Christian Kanzow, Patrick Mehlitz, Daniel Steck:
Relaxation schemes for mathematical programmes with switching constraints. 1223-1258 - Veronika Karl, Frank Pörner:
On the uniqueness of non-reducible multi-player control problems. 1259-1288 - Dmitry Kamzolov, Pavel E. Dvurechensky, Alexander V. Gasnikov:
Universal intermediate gradient method for convex problems with inexact oracle. 1289-1316
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.
last updated on 2026-01-13 00:45 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
