default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSIAM Journal on Optimization, Volume 31
Volume 31, Number 1, 2021
- Sebastian Garreis, Thomas M. Surowiec
, Michael Ulbrich:
An Interior-Point Approach for Solving Risk-Averse PDE-Constrained Optimization Problems with Coherent Risk Measures. 1-29 - Jie Wang, Victor Magron, Jean-Bernard Lasserre:
TSSOS: A Moment-SOS Hierarchy That Exploits Term Sparsity. 30-58 - Yang Liu, Fred Roosta:
Convergence of Newton-MR under Inexact Hessian Information. 59-90 - Md Abu Talhamainuddin Ansary, Geetanjali Panda:
A Globally Convergent SQCQP Method for Multiobjective Optimization Problems. 91-113 - Jie Wang, Victor Magron, Jean-Bernard Lasserre:
Chordal-TSSOS: A Moment-SOS Hierarchy That Exploits Term Sparsity with Chordal Extension. 114-141 - Carlos J. Nohra, Arvind U. Raghunathan, Nikolaos V. Sahinidis:
Spectral Relaxations and Branching Strategies for Global Optimization of Mixed-Integer Quadratic Programs. 142-171 - Jinhua Wang, Xiangmei Wang, Chong Li, Jen-Chih Yao:
Convergence Analysis of Gradient Algorithms on Riemannian Manifolds without Curvature Constraints and Application to Riemannian Mass. 172-199 - Iskander Aliev, Marcel Celaya, Martin Henk, Aled Williams:
Distance-Sparsity Transference for Vertices of Corner Polyhedra. 200-216 - Jiaming Liang, Renato D. C. Monteiro:
An Average Curvature Accelerated Composite Gradient Method for Nonconvex Smooth Composite Optimization Problems. 217-243 - Anas Barakat, Pascal Bianchi:
Convergence and Dynamical Behavior of the ADAM Algorithm for Nonconvex Stochastic Optimization. 244-274 - Teodora Dan, Andrea Lodi, Patrice Marcotte:
An Exact Algorithmic Framework for a Class of Mixed-Integer Programs with Equilibrium Constraints. 275-306 - Henri Calandra, Serge Gratton, Elisa Riccietti, Xavier Vasseur:
On High-Order Multilevel Optimization Strategies. 307-330 - Amitabh Basu, Michele Conforti, Marco Di Summa, Hongyi Jiang:
Split Cuts in the Plane. 331-347 - Caroline Geiersbach, Estefanía Loayza-Romero, Kathrin Welker:
Stochastic Approximation for Optimization in Shape Spaces. 348-376 - Eike Börgens, Christian Kanzow:
ADMM-Type Methods for Generalized Nash Equilibrium Problems in Hilbert Spaces. 377-403 - Regina Sandra Burachik, Minh N. Dao, Scott B. Lindstrom:
The Generalized Bregman Distance. 404-424 - Jérôme Stenger, Fabrice Gamboa, Merlin Keller:
Optimization of Quasi-convex Function over Product Measure Sets. 425-447 - Yun Kuen Cheung, Richard J. Cole, Yixin Tao:
Parallel Stochastic Asynchronous Coordinate Descent: Tight Bounds on the Possible Parallelism. 448-460 - Hideaki Nakao, Ruiwei Jiang, Siqian Shen:
Distributionally Robust Partially Observable Markov Decision Process with Moment-Based Ambiguity. 461-488 - Helmut Gfrerer, Jirí V. Outrata:
On a Semismooth* Newton Method for Solving Generalized Equations. 489-517 - Frank E. Curtis, Daniel P. Robinson, Clément W. Royer, Stephen J. Wright:
Trust-Region Newton-CG with Strong Second-Order Complexity Guarantees for Nonconvex Optimization. 518-544 - Nguyen Huy Chieu, Le Van Hien, Tran T. A. Nghia, Ha Anh Tuan:
Quadratic Growth and Strong Metric Subregularity of the Subdifferential via Subgradient Graphical Derivative. 545-568 - Ashkan Mohammadi, Boris S. Mordukhovich:
Variational Analysis in Normed Spaces with Applications to Constrained Optimization. 569-603 - Juan Kuntz, Philipp Thomas, Guy-Bart Stan, Mauricio Barahona:
Approximations of Countably Infinite Linear Programs over Bounded Measure Spaces. 604-625 - Hong-Kun Xu, Andrzej Cegielski:
The Landweber Operator Approach to the Split Equality Problem. 626-652 - Masoud Ahookhosh, Andreas Themelis, Panagiotis Patrinos:
A Bregman Forward-Backward Linesearch Algorithm for Nonconvex Composite Optimization: Superlinear Convergence to Nonisolated Local Minima. 653-685 - Sergei Chubanov:
A Generalized Simplex Method for Integer Problems Given by Verification Oracles. 686-701 - Brian C. Dandurand, Kibaek Kim, Sven Leyffer:
A Bilevel Approach for Identifying the Worst Contingencies for Nonconvex Alternating Current Power Systems. 702-726 - Dan Garber:
On the Convergence of Projected-Gradient Methods with Low-Rank Projections for Smooth Convex Minimization over Trace-Norm Balls and Related Problems. 727-753 - Luca Calatroni, Guillaume Garrigos, Lorenzo Rosasco, Silvia Villa:
Accelerated Iterative Regularization via Dual Diagonal Descent. 754-784 - Anton Rodomanov, Yurii E. Nesterov:
Greedy Quasi-Newton Methods with Explicit Superlinear Convergence. 785-811 - Stefan Sremac, Hugo J. Woerdeman, Henry Wolkowicz:
Error Bounds and Singularity Degree in Semidefinite Programming. 812-836 - Rafael Correa, Marco A. López, Pedro Pérez-Aros:
Necessary and Sufficient Optimality Conditions in DC Semi-infinite Programming. 837-865 - Sheng Cheng, Nuno C. Martins:
An Optimality Gap Test for a Semidefinite Relaxation of a Quadratic Program with Two Quadratic Constraints. 866-886 - Zhongxiao Jia, Fa Wang:
The Convergence of the Generalized Lanczos Trust-Region Method for the Trust-Region Subproblem. 887-914 - Jelena Diakonikolas, Michael I. Jordan:
Generalized Momentum-Based Methods: A Hamiltonian Perspective. 915-944 - Cheolmin Kim, Sanjay Mehrotra:
Solution Approaches to Linear Fractional Programming and Its Stochastic Generalizations Using Second Order Cone Approximations. 945-971 - Shambhavi Singh, Yves Lucet:
Linear-Time Convexity Test for Low-Order Piecewise Polynomials. 972-990 - Chris J. Maddison, Daniel Paulin, Yee Whye Teh, Arnaud Doucet:
Dual Space Preconditioning for Gradient Descent. 991-1016 - Raghu Pasupathy, Yongjia Song:
Adaptive Sequential Sample Average Approximation for Solving Two-Stage Stochastic Linear Programs. 1017-1048 - Paul Breiding, Nick Vannieuwenhoven:
The Condition Number of Riemannian Approximation Problems. 1049-1077
Volume 31, Number 2, 2021
- Andrea Cristofari, Francesco Rinaldi:
A Derivative-Free Method for Structured Optimization Problems. 1079-1107 - Prateek Jain, Dheeraj M. Nagaraj, Praneeth Netrapalli:
Making the Last Iterate of SGD Information Theoretically Optimal. 1108-1130 - Junyu Zhang, Lin Xiao:
MultiLevel Composite Stochastic Optimization via Nested Variance Reduction. 1131-1157 - Zhenhai Liu, Dumitru Motreanu, Shengda Zeng:
Generalized Penalty and Regularization Method for Differential Variational-Hemivariational Inequalities. 1158-1183 - Boris S. Mordukhovich, M. Ebrahim Sarabi:
Generalized Newton Algorithms for Tilt-Stable Minimizers in Nonsmooth Optimization. 1184-1214 - Audrey Repetti, Yves Wiaux:
Variable Metric Forward-Backward Algorithm for Composite Minimization Problems. 1215-1241 - Ramchandran Muthukumar, Drew P. Kouri, Madeleine Udell:
Randomized Sketching Algorithms for Low-Memory Dynamic Optimization. 1242-1275 - Bahareh Khazayel, Ali P. Farajzadeh, Christian Günther, Christiane Tammer:
On the Intrinsic Core of Convex Cones in Real Linear Spaces. 1276-1298 - Erfan Yazdandoost Hamedani, Necdet Serhat Aybat:
A Primal-Dual Algorithm with Line Search for General Convex-Concave Saddle Point Problems. 1299-1329 - Rubén López, Miguel Sama:
Horizon Maps and Graphical Convergence Revisited. 1330-1351 - Albert S. Berahas, Frank E. Curtis, Daniel P. Robinson, Baoyu Zhou:
Sequential Quadratic Optimization for Nonlinear Equality Constrained Stochastic Optimization. 1352-1379 - Aram V. Arutyunov, Dmitry Karamzin:
Square-Root Metric Regularity and Related Stability Theorems for Smooth Mappings. 1380-1409 - Chong Li, Kung Fu Ng, Jen-Chih Yao, Xiaopeng Zhao:
The FM and BCQ Qualifications for Inequality Systems of Convex Functions in Normed Linear Spaces. 1410-1432 - Maria Dostert, David de Laat, Philippe Moustrou:
Exact Semidefinite Programming Bounds for Packing Problems. 1433-1458 - Felix Harder, Patrick Mehlitz, Gerd Wachsmuth:
Reformulation of the M-Stationarity Conditions as a System of Discontinuous Equations and Its Solution by a Semismooth Newton Method. 1459-1488 - Albert S. Berahas, Liyuan Cao, Katya Scheinberg:
Global Convergence Rate Analysis of a Generic Line Search Algorithm with Noise. 1489-1518 - Ping-Fan Zhao, Qingna Li, Wei-Kun Chen, Ya-Feng Liu:
An Efficient Quadratic Programming Relaxation Based Algorithm for Large-Scale MIMO Detection. 1519-1545 - Bin Gao, Nguyen Thanh Son, Pierre-Antoine Absil, Tatjana Stykel:
Riemannian Optimization on the Symplectic Stiefel Manifold. 1546-1575 - Liaoyuan Zeng, Peiran Yu, Ting Kei Pong:
Analysis and Algorithms for Some Compressed Sensing Models Based on L1/L2 Minimization. 1576-1603
Volume 31, Number 3, 2021
- Xiao Li, Shixiang Chen, Zengde Deng, Qing Qu, Zhihui Zhu, Anthony Man-Cho So:
Weakly Convex Optimization over Stiefel Manifold Using Riemannian Subgradient-Type Methods. 1605-1634 - Pedro Pérez-Aros, Emilio Vilches:
Moreau Envelope of Supremum Functions with Applications to Infinite and Stochastic Programming. 1635-1657 - Sebastian Blauth:
Nonlinear Conjugate Gradient Methods for PDE Constrained Shape Optimization Based on Steklov-Poincaré-Type Metrics. 1658-1689 - Zhe Zhang, Shabbir Ahmed, Guanghui Lan:
Efficient Algorithms for Distributionally Robust Stochastic Optimization with Discrete Scenario Support. 1690-1721 - Luze Xu, Marcia Fampa, Jon Lee, Gabriel Ponte:
Approximate 1-Norm Minimization and Minimum-Rank Structured Sparsity for Various Generalized Inverses via Local Search. 1722-1747 - Ling Liang, Defeng Sun, Kim-Chuan Toh:
An Inexact Augmented Lagrangian Method for Second-Order Cone Programming with Applications. 1748-1773 - Fabián Flores-Bazán, Felipe Opazo:
Characterizing Convexity of Images for Quadratic-Linear Mappings with Applications in Nonconvex Quadratic Optimization. 1774-1796 - Chaobing Song, Yong Jiang, Yi Ma:
Unified Acceleration of High-Order Algorithms under General Hölder Continuity. 1797-1826 - Claus Danielson:
Fundamental Domains for Symmetric Optimization: Construction and Search. 1827-1849 - Andreas Van Barel, Stefan Vandewalle:
MG/OPT and Multilevel Monte Carlo for Robust Optimization of PDEs. 1850-1876 - Amir Beck, Marc Teboulle:
Dual Randomized Coordinate Descent Method for Solving a Class of Nonconvex Problems. 1877-1896 - Andrés Gómez:
Outlier Detection in Time Series via Mixed-Integer Conic Quadratic Optimization. 1897-1925 - Salihah Alwadani, Heinz H. Bauschke, Xianfu Wang:
Attouch-Théra Duality, Generalized Cycles, and Gap Vectors. 1926-1946 - Sergei Chubanov:
Method of Alternating Contractions and Its Applications to Some Convex Optimization Problems. 1947-1970 - Zihan Liu, Kannan Ramchandran:
Adaptive Douglas-Rachford Splitting Algorithm from a Yosida Approximation Standpoint. 1971-1998 - Brendan O'Donoghue:
Operator Splitting for a Homogeneous Embedding of the Linear Complementarity Problem. 1999-2023 - Peiran Yu, Ting Kei Pong, Zhaosong Lu:
Convergence Rate Analysis of a Sequential Convex Programming Method with Line Search for a Class of Constrained Difference-of-Convex Optimization Problems. 2024-2054 - Didier Aussel, Gemayqzel Bouza, Stephan Dempe, Sébastien Lepaul:
Genericity Analysis of Multi-Leader-Disjoint-Followers Game. 2055-2079 - Adrian S. Lewis, Tonghua Tian:
The Structure of Conservative Gradient Fields. 2080-2083 - Vincent Guigues, Renato D. C. Monteiro, Benar Fux Svaiter:
Inexact Cuts in Stochastic Dual Dynamic Programming Applied to Multistage Stochastic Nondifferentiable Problems. 2084-2110 - Harsha Gangammanavar, Suvrajeet Sen:
Stochastic Dynamic Linear Programming: A Sequential Sampling Algorithm for Multistage Stochastic Linear Programming. 2111-2140 - Tatiana Tatarenko, Angelia Nedich:
A Smooth Inexact Penalty Reformulation of Convex Problems with Linear Constraints. 2141-2170 - Harshal D. Kaushik, Farzad Yousefian:
A Method with Convergence Rates for Optimization Problems with Variational Inequality Constraints. 2171-2198 - Pontus Giselsson:
Nonlinear Forward-Backward Splitting with Projection Correction. 2199-2226 - Daniel Brosch, Monique Laurent, Andries Steenkamp:
Optimizing Hypergraph-Based Polynomials Modeling Job-Occupancy in Queuing with Redundancy Scheduling. 2227-2254 - Anton Schiela, Julian Ortiz:
An SQP Method for Equality Constrained Optimization on Hilbert Manifolds. 2255-2284 - Jean-Bernard Lasserre, Victor Magron, Swann Marx, Olivier Zahm:
Minimizing Rational Functions: A Hierarchy of Approximations via Pushforward Measures. 2285-2306 - Guanghui Lan, H. Edwin Romeijn, Zhiqiang Zhou:
Conditional Gradient Methods for Convex Optimization with General Affine and Nonlinear Constraints. 2307-2339 - Dimitris Bertsimas, Ryan Cory-Wright, Jean Pauphilet:
A Unified Approach to Mixed-Integer Optimization Problems With Logical Constraints. 2340-2367 - Jiawang Nie, Li Wang, Jane J. Ye, Suhan Zhong:
A Lagrange Multiplier Expression Method for Bilevel Polynomial Optimization. 2368-2395 - Christoph Neumann, Oliver Stein:
Generating Feasible Points for Mixed-Integer Convex Optimization Problems by Inner Parallel Cuts. 2396-2428 - Xi Yin Zheng, Kung Fu Ng:
Perturbation Analysis of Metric Subregularity for Multifunctions. 2429-2454
Volume 31, Number 4, 2021
- Caroline Geiersbach, Winnifried Wollner:
Optimality Conditions for Convex Stochastic Optimization Problems in Banach Spaces with Almost Sure State Constraints. 2455-2480 - Shaoyan Guo, Huifu Xu, Liwei Zhang:
Existence and Approximation of Continuous Bayesian Nash Equilibria in Games with Continuous Type and Action Spaces. 2481-2507 - Dmitrii M. Ostrovskii, Andrew Lowy, Meisam Razaviyayn:
Efficient Search of First-Order Nash Equilibria in Nonconvex-Concave Smooth Min-Max Problems. 2508-2538 - Karen I. Aardal, Andrea Lodi, Andrea Tramontani, Frederik von Heymann, Laurence A. Wolsey:
Lattice Reformulation Cuts. 2539-2557 - Weiwei Kong, Renato D. C. Monteiro:
An Accelerated Inexact Proximal Point Method for Solving Nonconvex-Concave Min-Max Problems. 2558-2585 - Mohit Bansil, Jun Kitagawa:
A Newton Algorithm for Semidiscrete Optimal Transport with Storage Fees. 2586-2613 - Lijun Ding, Madeleine Udell:
On the Simplicity and Conditioning of Low Rank Semidefinite Programs. 2614-2637 - Jeffrey Larson, Matt Menickelly, Baoyu Zhou:
Manifold Sampling for Optimizing Nonsmooth Nonconvex Compositions. 2638-2664 - Nguyen Thi Van Hang, M. Ebrahim Sarabi:
Local Convergence Analysis of Augmented Lagrangian Methods for Piecewise Linear-Quadratic Composite Optimization Problems. 2665-2694 - Lijun Ding, Alp Yurtsever, Volkan Cevher, Joel A. Tropp, Madeleine Udell:
An Optimal-Storage Approach to Semidefinite Programming Using Approximate Complementarity. 2695-2725 - Peijun Xiao, Zhisheng Xiao, Ruoyu Sun:
Two Symmetrized Coordinate Descent Methods Can Be O(n2) Times Slower Than the Randomized Version. 2726-2752 - Hadrien Hendrikx, Francis R. Bach, Laurent Massoulié:
An Optimal Algorithm for Decentralized Finite-Sum Optimization. 2753-2783 - Didier Aussel, Kien Cao-Van, David Salas:
Existence Results for Generalized Nash Equilibrium Problems under Continuity-Like Properties of Sublevel Sets. 2784-2806 - Yurii E. Nesterov:
Inexact High-Order Proximal-Point Methods with Auxiliary Search Procedure. 2807-2828 - Shengda Zeng, Stanislaw Migórski, Zhenhai Liu:
Well-Posedness, Optimal Control, and Sensitivity Analysis for a Class of Differential Variational-Hemivariational Inequalities. 2829-2862 - Roger Behling, José Yunier Bello Cruz, Luiz-Rafael Santos:
Infeasibility and Error Bound Imply Finite Convergence of Alternating Projections. 2863-2892 - Dimitris Bertsimas, Dick den Hertog, Jean Pauphilet:
Probabilistic Guarantees in Robust Optimization. 2893-2920 - Cristian Daniel Alecsa, Szilárd Csaba László:
Tikhonov Regularization of a Perturbed Heavy Ball System with Vanishing Damping. 2921-2954 - Jiaming Liang, Renato D. C. Monteiro:
A Proximal Bundle Variant with Optimal Iteration-Complexity for a Large Range of Prox Stepsizes. 2955-2986 - Luis M. Briceño-Arias, Fernando Roldán:
Split-Douglas-Rachford Algorithm for Composite Monotone Inclusions and Split-ADMM. 2987-3013 - Aykut Bulut, Ted K. Ralphs:
On the Complexity of Inverse Mixed Integer Linear Optimization. 3014-3043 - Alois Pichler, Alexander Shapiro:
Mathematical Foundations of Distributionally Robust Multistage Optimization. 3044-3067 - Yakui Huang, Yu-Hong Dai, Xinwei Liu:
Equipping the Barzilai-Borwein Method with the Two Dimensional Quadratic Termination Property. 3068-3096 - Nachuan Xiao, Xin Liu, Ya-Xiang Yuan:
Exact Penalty Function for ℓ2, 1 Norm Minimization over the Stiefel Manifold. 3097-3126 - Stéphane Alarie, Charles Audet, Pierre-Yves Bouchet, Sébastien Le Digabel:
Optimization of Stochastic Blackboxes with Adaptive Precision. 3127-3156 - Archis Ghate, Christopher Thomas Ryan, Robert L. Smith:
A Simplex Method for Countably Infinite Linear Programs. 3157-3183 - Shenglong Zhou, Lili Pan, Naihua Xiu, Hou-Duo Qi:
Quadratic Convergence of Smoothing Newton's Method for 0/1 Loss Optimization. 3184-3211 - Boris S. Mordukhovich, Pedro Pérez-Aros:
Generalized Leibniz Rules and Lipschitzian Stability for Expected-Integral Mappings. 3212-3246
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-07-15 00:53 CEST 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, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
