default search action
SIAM Journal on Optimization, Volume 29
Volume 29, Number 1, 2019
- Daniel Blado, Alejandro Toriello
:
Relaxation Analysis for the Dynamic Knapsack Problem with Stochastic Item Sizes. 1-30 - Luis Felipe Bueno
Optimality Conditions and Constraint Qualifications for Generalized Nash Equilibrium Problems and Their Practical Implications. 31-54 - Merve Bodur
Lower Bounds on the Lattice-Free Rank for Packing and Covering Integer Programs. 55-76 - Geovani Nunes Grapiglia
Accelerated Regularized Newton Methods for Minimizing Composite Convex Functions. 77-99 - Olivier Fercoq
A Coordinate-Descent Primal-Dual Algorithm with Large Step Size and Possibly Nonseparable Functions. 100-134 - Xiaojun Chen, Alexander Shapiro, Hailin Sun
Convergence Analysis of Sample Average Approximation of Two-Stage Stochastic Generalized Equations. 135-161 - David H. Gutman
Convergence Rates of Proximal Gradient Methods via the Convex Conjugate. 162-174 - Alfredo N. Iusem, Alejandro Jofré, Roberto I. Oliveira
Variance-Based Extragradient Methods with Line Search for Stochastic Variational Inequalities. 175-206 - Damek Davis, Dmitriy Drusvyatskiy
Stochastic Model-Based Minimization of Weakly Convex Functions. 207-239 - Xujin Chen, Wenan Zang, Qiulan Zhao:
Densities, Matchings, and Fractional Edge-Colorings. 240-261 - Andreas Griewank, Andrea Walther
Relaxing Kink Qualifications and Proving Convergence Rates in Piecewise Smooth Optimization. 262-289 - Christian Hess
Generic Consistency for Approximate Stochastic Programming and Statistical Problems. 290-317 - Kibaek Kim
An Asynchronous Bundle-Trust-Region Method for Dual Decomposition of Stochastic Mixed-Integer Programming. 318-342 - Santiago Paternain
A Newton-Based Method for Nonconvex Optimization with Fast Evasion of Saddle Points. 343-368 - Daniel Rehfeldt
Combining NP-Hard Reduction Techniques and Strong Heuristics in an Exact Algorithm for the Maximum-Weight Connected Subgraph Problem. 369-398 - Amir Ali Ahmadi
Polynomial Norms. 399-422 - Helmut Gfrerer
Second-Order Variational Analysis of Parametric Constraint and Variational Systems. 423-453 - Francesca Maggioni
Guaranteed Bounds for General Nondiscrete Multistage Risk-Averse Stochastic Optimization Programs. 454-483 - Chin How Jeffrey Pang:
Distributed Deterministic Asynchronous Algorithms in Time-Varying Graphs Through Dykstra Splitting. 484-510 - Aris Daniilidis
Linear Structure of Functions with Maximal Clarke Subdifferential. 511-521 - Jean-Paul Penot
Error Bounds and Multipliers in Constrained Optimization Problems with Tolerance. 522-540 - Peter Ochs:
Unifying Abstract Inexact Convergence Theorems and Block Coordinate Variable Metric iPiano. 541-570 - Liqiang Song, Wei Hong Yang:
A Block Lanczos Method for the Extended Trust-Region Subproblem. 571-594 - Coralia Cartis, Nick I. M. Gould
Universal Regularization Methods: Varying the Power, the Smoothness and the Accuracy. 595-615 - Shuoguang Yang
Multilevel Stochastic Gradient Methods for Nested Composition Optimization. 616-659 - Jelena Diakonikolas
The Approximate Duality Gap Technique: A Unified Theory of First-Order Methods. 660-689 - Hao-Hsiang Wu
Probabilistic Partial Set Covering with an Oracle for Chance Constraints. 690-718 - Cheng Lu, Ya-Feng Liu
Tightness of a New and Enhanced Semidefinite Relaxation for MIMO Detection. 719-742 - Roberto Andreani, Nadia S. Fazzio, María Laura Schuverdt, Leonardo D. Secchin
A Sequential Optimality Condition Related to the Quasi-normality Constraint Qualification and Its Algorithmic Consequences. 743-766 - Christian Kanzow
The Multiplier-Penalty Method for Generalized Nash Equilibrium Problems in Banach Spaces. 767-793 - Julia Niebling
A Branch-and-Bound-Based Algorithm for Nonconvex Multiobjective Optimization. 794-821 - Dávid Papp
Sum-of-Squares Optimization without Semidefinite Programming. 822-851 - Alperen Ali Ergür
Approximating Nonnegative Polynomials via Spectral Sparsification. 852-873 - Xiaojun Chen, Philippe L. Toint, Hong Wang:
Complexity of Partially Separable Convexly Constrained Optimization with Non-Lipschitzian Singularities. 874-903 - Man-Chung Yue
On the Quadratic Convergence of the Cubic Regularization Method under a Local Error Bound Condition. 904-932 - Christian Clason
Acceleration and Global Convergence of a First-Order Primal-Dual Method for Nonconvex Problems. 933-963
Volume 29, Number 2, 2019
- Albert S. Berahas
Derivative-Free Optimization of Noisy Functions via Quasi-Newton Methods. 965-993 - Aram V. Arutyunov, Sergey E. Zhukovskiy
Variational Principles in Analysis and Existence of Minimizers for Functions on Metric Spaces. 994-1016 - Jana Thomann
A Trust-Region Algorithm for Heterogeneous Multiobjective Optimization. 1017-1047 - Cosmin G. Petra
A Structured Quasi-Newton Algorithm for Optimizing with Incomplete Hessian Information. 1048-1075 - Pierre Bonami, Andrea Lodi, Jonas Schweiger, Andrea Tramontani:
Solving Quadratic Programming by Cutting Planes. 1076-1105 - Rafael Correa, Abderrahim Hantoute, Marco Antonio López Cerdá
Moreau-Rockafellar-Type Formulas for the Subdifferential of the Supremum Function. 1106-1130 - Nir Halman
Toward Breaking the Curse of Dimensionality: An FPTAS for Stochastic Dynamic Programs with Multidimensional Actions and Scalar States. 1131-1163 - Charles Audet, Sébastien Le Digabel
The Mesh Adaptive Direct Search Algorithm for Granular and Discrete Variables. 1164-1189 - Amitabh Basu
Can Cut-Generating Functions Be Good and Efficient? 1190-1210 - Napat Rujeerapaiboon
Size Matters: Cardinality-Constrained Clustering and Outlier Detection via Conic Optimization. 1211-1239 - Luze Xu
More Virtuous Smoothing. 1240-1259 - Claire Boyer, Antonin Chambolle
On Representer Theorems and Convex Regularization. 1260-1281 - Paul T. Boggs, Richard H. Byrd:
Adaptive, Limited-Memory BFGS Algorithms for Unconstrained Optimization. 1282-1299 - Radu Ioan Bot, Ernö Robert Csetnek, Dang-Khoa Nguyen
A Proximal Minimization Algorithm for Structured Nonconvex and Nonsmooth Problems. 1300-1328 - Armin Eftekhari
Sparse Inverse Problems over Measures: Equivalence of the Conditional Gradient and Exchange Methods. 1329-1349 - Benjamin Grimmer
Convergence Rates for Deterministic and Stochastic Subgradient Methods without Lipschitz Continuity. 1350-1365 - Michael P. Friedlander
Polar Convolution. 1366-1391 - Yashan Xu:
Saddle Points of Obstacles for an Elliptic Variational Inequality. 1392-1407 - Hongzhou Lin, Julien Mairal, Zaïd Harchaoui:
An Inexact Variable Metric Proximal Point Algorithm for Generic Quasi-Newton Acceleration. 1408-1443 - Hiroyuki Sato, Hiroyuki Kasai, Bamdev Mishra:
Riemannian Stochastic Variance Reduced Gradient Algorithm with Retraction and Vector Transport. 1444-1472 - Andrea Walther
Characterizing and Testing Subdifferential Regularity in Piecewise Smooth Optimization. 1473-1501 - Phan Quoc Khanh
Versions of the Weierstrass Theorem for Bifunctions and Solution Existence in Optimization. 1502-1523 - Boris S. Mordukhovich, M. Ebrahim Sarabi:
Criticality of Lagrange Multipliers in Variational Systems. 1524-1557 - Didier Aussel, Kien Cao Van
Quasi-Variational Inequality Problems over Product Sets with Quasi-monotone Operators. 1558-1577 - Karima Boufi, Ahmed Roubi:
Duality Results and Dual Bundle Methods Based on the Dual Method of Centers for Minimax Fractional Programs. 1578-1602 - Rujun Jiang
Novel Reformulations and Efficient Algorithms for the Generalized Trust Region Subproblem. 1603-1633 - Lorenzo Lampariello
The Standard Pessimistic Bilevel Problem. 1634-1656 - Weiwei Xu, Wen Li, Lei Zhu, Xueping Huang:
The Analytic Solutions of a Class of Constrained Matrix Minimization and Maximization Problems with Applications. 1657-1686 - Ali Ridha Mahjoub, Michael Poss
Distance Transformation for Network Design Problems. 1687-1713 - Pedro Pérez-Aros:
Subdifferential Formulae for the Supremum of an Arbitrary Family of Functions. 1714-1743
Volume 29, Number 3, 2019
- Daniel Prusa
Solving LP Relaxations of Some NP-Hard Problems Is As Hard As Solving Any Linear Program. 1745-1771 - Luca Calatroni
Backtracking Strategies for Accelerated Descent Methods with Smooth Composite Objectives. 1772-1798 - Min Zhang
Two-Stage Quadratic Games under Uncertainty and Their Solution by Progressive Hedging Algorithms. 1799-1818 - Dinh The Luc, Michel Volle:
Duality for Optimization Problems with Infinite Sums. 1819-1843 - Long-Fei Wang, Yong Xia
A Linear-Time Algorithm for Globally Maximizing the Sum of a Generalized Rayleigh Quotient and a Quadratic Form on the Unit Sphere. 1844-1869 - Richard H. Byrd, Jorio Cocola, Richard A. Tapia:
Extending the Pennisi-McCormick Second-Order Sufficiency Theory for Nonlinear Programming to Infinite Dimensions. 1870-1878 - Shuyang Ling, Ruitu Xu, Afonso S. Bandeira:
On the Landscape of Synchronization Networks: A Perspective from Nonconvex Optimization. 1879-1907 - Damek Davis, Benjamin Grimmer
Proximally Guided Stochastic Subgradient Method for Nonsmooth, Nonconvex Problems. 1908-1930 - Patrick R. Johnstone, Jonathan Eckstein
Convergence Rates for Projective Splitting. 1931-1957 - James V. Burke, Yuan Gao, Tim Hoheisel:
Variational Properties of Matrix Functions via the Generalized Matrix-Fractional Function. 1958-1987 - Marie-Ange Dahito, Dominique Orban:
The Conjugate Residual Method in Linesearch and Trust-Region Methods. 1988-2025 - Meixia Lin
Efficient Sparse Semismooth Newton Methods for the Clustered Lasso Problem. 2026-2052 - Mila Nikolova, Pauline Tan
Alternating Structure-Adapted Proximal Gradient Descent for Nonconvex Nonsmooth Block-Regularized Problems. 2053-2078 - Caroline Geiersbach, Georg Ch. Pflug:
Projected Stochastic Gradients for Convex Constrained Problems in Hilbert Spaces. 2079-2099 - Immanuel M. Bomze
Hessian Barrier Algorithms for Linearly Constrained Optimization Problems. 2100-2127 - Jean-Bernard Lasserre
In SDP Relaxations, Inaccurate Solvers Do Robust Optimization. 2128-2145 - Yair Carmon
Gradient Descent Finds the Cubic-Regularized Nonconvex Newton Step. 2146-2178 - Wim van Ackooij
Generalized Differentiation of Probability Functions Acting on an Infinite System of Constraints. 2179-2210 - Immanuel M. Bomze
First-order Methods for the Impatient: Support Identification in Finite Time with Convergent Frank-Wolfe Variants. 2211-2226 - Hédy Attouch, Zaki Chbani, Hassan Riahi:
Fast Proximal Methods via Time Scaling of Damped Inertial Dynamics. 2227-2256 - Hilal Asi, John C. Duchi:
Stochastic (Approximate) Proximal Point Methods: Convergence, Optimality, and Adaptivity. 2257-2290 - Zongshan Shen, Jen-Chih Yao, Xi Yin Zheng:
Calmness and the Abadie CQ for Multifunctions and Linear Regularity for a Collection of Closed Sets. 2291-2319 - Burak Kocuk
On Subadditive Duality for Conic Mixed-integer Programs. 2320-2336 - Zhengling Qi
Estimation of Individualized Decision Rules Based on an Optimized Covariate-Dependent Equivalent of Random Outcomes. 2337-2362 - Vera Roshchina
Facially Dual Complete (Nice) Cones and Lexicographic Tangents. 2363-2387 - Jinhua Wang, Yaohua Hu
Extended Newton Methods for Multiobjective Optimization: Majorizing Function Technique and Convergence Analysis. 2388-2421
Volume 29, Number 4, 2019
- Ronny Bergmann
Intrinsic Formulation of KKT Conditions and Constraint Qualifications on Smooth Manifolds. 2423-2444 - Stephen Becker
On Quasi-Newton Forward-Backward Splitting: Proximal Calculus and Convergence. 2445-2481 - Peter Ochs, Thomas Pock:
Adaptive FISTA for Nonconvex Optimization. 2482-2503 - Ewa M. Bednarczuk, K. E. Rutkowski
On Lipschitz-Like Property for Polyhedral Moving Sets. 2504-2516 - Orizon P. Ferreira
Gradient Method for Optimization on Riemannian Manifolds with Lower Bounded Curvature. 2517-2541 - Mert Gürbüzbalaban, Asuman E. Ozdaglar, Pablo A. Parrilo
Convergence Rate of Incremental Gradient and Incremental Newton Methods. 2542-2565 - Weiwei Kong
Complexity of a Quadratic Penalty Accelerated Inexact Proximal Point Method for Solving Linearly Constrained Nonconvex Composite Programs. 2566-2593 - Biel Roig-Solvas, Lee Makowski, Dana H. Brooks:
A Proximal Operator for Multispectral Phase Retrieval Problems. 2594-2607 - Paul Breiding, Khazhgali Kozhasov, Antonio Lerario
Random Spectrahedra. 2608-2624 - Kuang Bai
Directional Quasi-/Pseudo-Normality as Sufficient Conditions for Metric Subregularity. 2625-2649 - Marcel Kenji de Carli Silva
Strict Complementarity in Semidefinite Optimization with Elliptopes Including the MaxCut SDP. 2650-2676 - César Gutiérrez
Limit Behavior of Approximate Proper Solutions in Vector Optimization. 2677-2696 - Minh N. Dao
Adaptive Douglas-Rachford Splitting Algorithm for the Sum of Two Operators. 2697-2724 - Zhaosong Lu
Nonmonotone Enhanced Proximal DC Algorithms for a Class of Structured Nonsmooth DC Programming. 2725-2752 - Guanghui Lan, Yu Yang
Accelerated Stochastic Algorithms for Nonconvex Finite-Sum and Multiblock Optimization. 2753-2784 - Ying Cui
Computing the Best Approximation over the Intersection of a Polyhedral Set and the Doubly Nonnegative Cone. 2785-2813 - Ion Necoara, Peter Richtárik
Randomized Projection Methods for Convex Feasibility: Conditioning and Convergence Rates. 2814-2852 - Seyedehsomayeh Hosseini, André Uschmajew:
A Gradient Sampling Method on Algebraic Varieties and Application to Nonsmooth Low-Rank Optimization. 2853-2880 - Stefania Bellavia, Gianmarco Gurioli
Adaptive Regularization Algorithms with Inexact Evaluations for Nonconvex Optimization. 2881-2915 - Andre Milzarek, Xiantao Xiao
A Stochastic Semismooth Newton Method for Nonsmooth Nonconvex Optimization. 2916-2948 - Oliver Habeck, Marc E. Pfetsch, Stefan Ulbrich
Global Optimization of Mixed-Integer ODE Constrained Network Problems Using the Example of Stationary Gas Transport. 2949-2985 - Jein-Shan Chen
Exact Formula for the Second-Order Tangent Set of the Second-Order Cone Complementarity Set. 2986-3011 - Giampaolo Liuzzi, Stefano Lucidi, Francesco Rinaldi, Luís Nunes Vicente
Trust-Region Methods for the Derivative-Free Optimization of Nonsmooth Black-Box Functions. 3012-3035 - Necdet Serhat Aybat, Erfan Yazdandoost Hamedani:
A Distributed ADMM-like Method for Resource Sharing over Time-Varying Networks. 3036-3068 - Livia M. Betz
Strong Stationarity for Optimal Control of a Nonsmooth Coupled System: Application to a Viscous Evolutionary Variational Inequality Coupled with an Elliptic PDE. 3069-3099 - Matus Benko, Helmut Gfrerer
Characterizations of Tilt-Stable Minimizers in Second-Order Cone Programming. 3100-3130 - Jean-François Aujol
Optimal Convergence Rates for Nesterov Acceleration. 3131-3153 - Alberto Del Pia
Subdeterminants and Concave Integer Quadratic Programming. 3154-3173 - Christian Kanzow
Quasi-Variational Inequalities in Banach Spaces: Theory and Augmented Lagrangian Methods. 3174-3200 - Roberto Andreani, Gabriel Haeser, Leonardo D. Secchin
New Sequential Optimality Conditions for Mathematical Programs with Complementarity Constraints and Algorithmic Consequences. 3201-3230
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 2024-11-04 20:33 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: