default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDOptimization Methods and Software, Volume 37
Volume 37, Number 1, January 2022
- Qingqiong Cai
, Neng Fan, Yongtang Shi, Shunyu Yao:
Integer linear programming formulations for double roman domination problem. 1-22 - Cesar Beltran-Royo:
Fast scenario reduction by conditional scenarios in two-stage stochastic MILP problems. 23-44 - Chin Pang Ho, Michal Kocvara, Panos Parpas:
Newton-type multilevel optimization method. 45-78 - Hao Wang, Fan Zhang, Jiashan Wang, Yuyang Rong:
An inexact first-order method for constrained nonlinear optimization. 79-112 - Masoud Ahookhosh, Ronan M. T. Fleming, Phan Tu Vuong:
Finding zeros of Hölder metrically subregular mappings via globally convergent Levenberg-Marquardt methods. 113-149 - Ali Gharaei, Fariborz Jolai:
Two heuristic methods based on decomposition to the integrated multi-agent supply chain scheduling and distribution problem. 150-174 - L. Calderón, Maria Aparecida Diniz Ehrhardt, José Mario Martínez:
On high-order model regularization for multiobjective optimization. 175-191 - Soodabeh Asadi, N. Mahdavi-Amiri, Zsolt Darvay, Petra Renáta Rigó:
Full Nesterov-Todd step feasible interior-point algorithm for symmetric cone horizontal linear complementarity problem based on a positive-asymptotic barrier function. 192-213 - Max L. N. Gonçalves, Jefferson G. Melo, Renato D. C. Monteiro:
Projection-free accelerated method for convex optimization. 214-240 - Christopher John Price:
Direct search nonsmooth constrained optimization via rounded ℓ1 penalty functions. 241-263 - Jinlong Lei, Uday V. Shanbhag:
Asynchronous variance-reduced block schemes for composite non-convex stochastic optimization: block-specific steplengths and adapted batch-sizes. 264-294 - Elvis M. R. Torrealba, Luiz Carlos Matioli, Mostafa Nasri, R. A. Castillo:
Exponential augmented Lagrangian methods for equilibrium problems. 295-319 - Yi-Fen Ke, Changfeng Ma:
On SOR-like iteration methods for solving weakly nonlinear systems. 320-337 - Anuj Bajaj, Boris S. Mordukhovich, Nguyen Mau Nam, Tuyen Tran:
Solving a continuous multifacility location problem by DC algorithms. 338-360 - Henri Calandra, Serge Gratton, Elisa Riccietti, Xavier Vasseur:
On a multilevel Levenberg-Marquardt method for the training of artificial neural networks and its application to the solution of partial differential equations. 361-386 - Haibin Chen, Liqun Qi, Yiju Wang, Guanglu Zhou:
Further results on sum-of-squares tensors. 387-403
Volume 37, Number 2, March 2022
- Ernesto G. Birgin, Luis Felipe Bueno, José Mario Martínez:
On the complexity of solving feasibility problems with regularized models. 405-424 - Matthew E. Wilhelm, Matthew D. Stuber:
EAGO.jl: easy advanced global optimization in Julia. 425-450 - Lukás Adam, Václav Mácha:
Projections onto the canonical simplex with additional linear inequalities. 451-479 - Matthew R. Billingsley, Paul I. Barton:
Generalized derivatives of computer programs. 480-502 - Tim Hoheisel, Blanca Pablos, Aram-Alexandre Pooladian, Alexandra Schwartz, Luke Steverango:
A study of one-parameter regularization methods for mathematical programs with vanishing constraints. 503-545 - Reza Najian Asl, Ihar Antonau, Aditya Ghantasala, Wulf G. Dettmer, Roland Wüchner, Kai-Uwe Bletzinger:
A partitioned scheme for adjoint shape sensitivity analysis of fluid-structure interactions involving non-matching meshes. 546-576 - Stanislav Baklanov, Maria Stefanova, Sergey Lupuleac:
Newton projection method as applied to assembly simulation. 577-604 - Geovani Nunes Grapiglia, Yurii E. Nesterov:
Tensor methods for finding approximate stationary points of convex functions. 605-638 - Abdelouafi Ghazi, Ahmed Roubi:
A DC approach for minimax fractional optimization programs with ratios of convex functions. 639-657 - Vanessa Krebs, Martin Schmidt:
Γ-robust linear complementarity problems. 658-691 - I. G. Akrotirianakis, M. Gratton, Joshua Griffin, Seyed Alireza Yektamaram, Wenwen Zhou:
Simultaneous iterative solutions for the trust-region and minimum eigenvalue subproblem. 692-711 - Yuan Zhang, Huifu Xu, Wei Wang:
Preference robust models in multivariate utility-based shortfall risk minimization. 712-752 - Heejune Sheen, Makoto Yamashita:
Exploiting aggregate sparsity in second-order cone relaxations for quadratic constrained quadratic programming problems. 753-771 - Michael Herty, Sonja Steffensen, Anna Thünen:
Solving quadratic multi-leader-follower games by smoothing the follower's best response. 772-799
Volume 37, Number 3, May 2022
- Jordi Castro, Paula de la Lama-Zubirán:
A new interior-point approach for large separable convex quadratic two-stage stochastic problems. 801-829 - M. R. Eslahchi, Sanaz Bojari:
Global convergence of a new sufficient descent spectral three-term conjugate gradient class for large-scale optimization. 830-843 - Frank E. Curtis, Rui Shi:
A fully stochastic second-order trust region method. 844-877 - Yurii E. Nesterov:
Inexact basic tensor methods for some classes of convex optimization problems. 878-906 - Anton Anikin, Alexander V. Gasnikov, Alexander Gornov, Dmitry Kamzolov, Yury Maximov, Yurii E. Nesterov:
Efficient numerical methods to solve sparse linear equations with application to PageRank. 907-935 - Yurii E. Nesterov, Mihai I. Florea:
Gradient methods with memory. 936-953 - David Avis, David Bremner:
Sparktope: linear programs from algorithms. 954-981 - Mehran Hasanzadeh, Behrooz Alizadeh, Fahimeh Baroughi:
Optimal algorithms for some inverse uncapacitated facility location problems on networks. 982-1005 - Daniel Dörfler, Andreas Löhne, Christopher Schneider, Benjamin Weißing:
A Benson-type algorithm for bounded convex vector optimization problems with vertex selection. 1006-1026 - Riley Badenbroek, Joachim Dahl:
An algorithm for nonsymmetric conic optimization inspired by MOSEK. 1027-1064 - Beatriz Brito Oliveira, Maria Antónia Carravilla, José Fernando Oliveira, Mauricio G. C. Resende:
A C++ application programming interface for co-evolutionary biased random-key genetic algorithms for solution and scenario generation. 1065-1086 - Hassan Rafique, Mingrui Liu, Qihang Lin, Tianbao Yang:
Weakly-convex-concave min-max optimization: provable algorithms and applications in machine learning. 1087-1121 - Paola Festa, Serena Fugaro, Francesca Guerriero:
Shortest path reoptimization vs resolution from scratch: a computational comparison. 1122-1144 - Jingyong Tang, Jinchuan Zhou:
A modified damped Gauss-Newton method for non-monotone weighted linear complementarity problems. 1145-1164 - Ludwig Kampel, Michael Wagner, Ilias S. Kotsireas, Dimitris E. Simos:
A primer on the application of neural networks to covering array generation. 1165-1202
Volume 37, Number 4, July 2022
- Nachuan Xiao, Xin Liu, Ya-Xiang Yuan:
A class of smooth exact penalty function methods for optimization problems with orthogonality constraints. 1205-1241 - Francisco Facchinei, Vyacheslav Kungurtsev, Lorenzo Lampariello, Gesualdo Scutari:
Diminishing stepsize methods for nonconvex composite problems via ghost penalties: from the general to the convex regular constrained case. 1242-1268 - Aliyu Muhammed Awwal, Poom Kumam, Lin Wang, Mahmoud Muhammad Yahaya, Hassan Mohammad:
On the Barzilai-Borwein gradient methods with structured secant equation for nonlinear least squares problems. 1269-1288 - Adil M. Bagirov, Sona Taheri, Napsu Karmitsa, Nargiz Sultanova, Soodabeh Asadi:
Robust piecewise linear L1-regression via nonsmooth DC optimization. 1289-1309 - Hani Ahmadzadeh, Nezam Mahdavi-Amiri:
A competitive inexact nonmonotone filter SQP method: convergence analysis and numerical results. 1310-1343 - Alexandre Ghannad, Dominique Orban, Michael A. Saunders:
Linear systems arising in interior methods for convex optimization: a symmetric formulation with bounded condition number. 1344-1369 - Abdulkarim Hassan Ibrahim, Poom Kumam, Ahmad Kamandi, Auwal Bala Abubakar:
An efficient hybrid conjugate gradient method for unconstrained optimization. 1370-1383 - Luigi Di Puglia Pugliese, Daniele Ferone, Paola Festa, Francesca Guerriero, Giusy Macrina:
Solution approaches for the vehicle routing problem with occasional drivers and time windows. 1384-1414 - Morteza Maleknia, Mostafa Shamsi:
A quasi-Newton proximal bundle method using gradient sampling technique for minimizing nonsmooth convex functions. 1415-1446 - Zhang Wei, Kees Roos:
Using Nemirovski's Mirror-Prox method as basic procedure in Chubanov's method for solving homogeneous feasibility problems. 1447-1470 - Songqiang Qiu:
A globally convergent regularized interior point method for constrained optimization. 1471-1506 - Xiaokai Chang, Sanyang Liu, Zhao Deng, Suoping Li:
An inertial subgradient extragradient algorithm with adaptive stepsizes for variational inequality problems. 1507-1526 - Olaniyi Samuel Iyiola, Cyril Dennis Enyi, Yekini Shehu:
Reflected three-operator splitting method for monotone inclusion problem. 1527-1565
Volume 37, Number 5, September 2022
- Anatoli B. Juditsky, Arkadi Nemirovski:
On well-structured convex-concave saddle point problems and variational inequalities with monotone operators. 1567-1602 - Darina Dvinskikh:
Stochastic approximation versus sample average approximation for Wasserstein barycenters. 1603-1635 - Lukás Adam, Václav Mácha, Václav Smídl, Tomás Pevný:
General framework for binary classification on top samples. 1636-1667 - Albert S. Berahas, Majid Jahani, Peter Richtárik, Martin Takác:
Quasi-Newton methods for machine learning: forget the past, just sample. 1668-1704 - Igor Konnov:
Exact penalties for decomposable convex optimization problems. 1705-1724 - Mina Lotfi, Seyed Mohammad Hosseini:
An efficient hybrid conjugate gradient method with sufficient descent property for unconstrained optimization. 1725-1739 - Ramzi Ben Mhenni, Sébastien Bourguignon, Jordan Ninin:
Global optimization for sparse solution of least squares problems. 1740-1769 - Andreas Fischer, Alain B. Zemkoho, Shenglong Zhou:
Semismooth Newton-type method for bilevel optimization: global convergence and extensive numerical experiments. 1770-1804 - Fatemeh Keshavarz-Kohjerdi:
Off-line exploration of rectangular cellular environments with a rectangular obstacle. 1805-1819 - Xiao Liu, Chungen Shen, Li Wang:
A dual active-set proximal Newton algorithm for sparse approximation of correlation matrices. 1820-1844 - Ion Necoara:
Stochastic block projection algorithms with extrapolation for convex feasibility problems. 1845-1875 - Giorgio Costa, Roy H. Kwon:
Data-driven distributionally robust risk parity portfolio optimization. 1876-1911 - Mahdi Roozbeh, Saman Babaie-Kafaki, Zohre Aminifard:
Improved high-dimensional regression models with matrix approximations applied to the comparative case studies with support vector machines. 1912-1929 - Andrei Draganescu, Mona Hajghassem:
Optimal order multigrid preconditioners for the distributed control of parabolic equations with coarsening in space and time. 1930-1964
Volume 37, Number 6, November 2022
- Nicolas Boutet, Joris Degroote, Rob Haelterman:
A symmetric grouped and ordered multi-secant Quasi-Newton update formula. 1979-2000 - Daniel Brosch, Etienne de Klerk:
Jordan symmetry reduction for conic optimization over the doubly nonnegative cone: theory and software. 2001-2020 - Maicon Marques Alves:
Variants of the A-HPE and large-step A-HPE algorithms for strongly convex problems with applications to accelerated high-order tensor methods. 2021-2051 - Puya Latafat, Panagiotis Patrinos:
Primal-dual algorithms for multi-agent structured optimization over message-passing architectures with bounded communication delays. 2052-2079 - Kai Hoppmann-Baum, Oleg Burdakov, Gioni Mexi, Carl Johan Casselgren, Thorsten Koch:
Length-constrained cycle partition with an application to UAV routing. 2080-2116 - M. Sayadi Shahraki, H. Mansouri, Ali Delavarkhalafi:
A wide neighbourhood predictor-corrector infeasible-interior-point algorithm for symmetric cone programming. 2117-2134 - Roberto Andreani, Ana Luísa Custódio, Marcos Raydan:
Using first-order information in direct multisearch for multiobjective optimization. 2135-2156 - Matteo Lapucci:
A penalty decomposition approach for multi-objective cardinality-constrained optimization problems. 2157-2189 - Hiroshi Yamashita:
Convergence to a second-order critical point by a primal-dual interior point trust-region method for nonlinear semidefinite programming. 2190-2224 - Horatiu Cheval, Laurentiu Leustean:
Quadratic rates of asymptotic regularity for the Tikhonov-Mann iteration. 2225-2240 - Wim van Ackooij, Welington de Oliveira:
Addendum to the paper 'Nonsmooth DC-constrained optimization: constraint qualification and minimizing methodologies'. 2241-2250 - Dezhou Kong, Li Sun, Haibin Chen, Yun Wang:
Isotonicity of the proximity operator and stochastic optimization problems in Hilbert quasi-lattices endowed with Lorentz cones. 2251-2272 - Petar Kunstek, Marko Vrdoljak:
A quasi-Newton method in shape optimization for a transmission problem. 2273-2299 - Anqi Fu, Lei Xing, Stephen P. Boyd:
Operator splitting for adaptive radiation therapy with nonlinear health dynamics. 2300-2323 - Mihai I. Florea:
Exact gradient methods with memory. 2324-2351 - Wenjie Wang, Pengyu Wang, Jiawei Yang, Fei Xiao, Weihua Zhang, Zeping Wu:
Sequential approximate optimization with adaptive parallel infill strategy assisted by inaccurate Pareto front. 2352-2376
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-30 23:02 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:
