default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSIAM Journal on Optimization, Volume 27
Volume 27, Number 1, 2017
- Jonathan M. Borwein, Guoyin Li
, Matthew K. Tam:
Convergence Rate Analysis for Averaged Fixed Point Iterations in Common Fixed Point Problems. 1-33 - William B. Haskell, J. George Shanthikumar, Zuo-Jun Max Shen:
Primal-Dual Algorithms for Optimization with Stochastic Dominance. 34-66 - Chao Ding, Defeng Sun, Liwei Zhang:
Characterization of the Robust Isolated Calmness for a Class of Conic Programming Problems. 67-90 - Matthias Claus, Volker Krätschmer, Rüdiger Schultz:
Weak Continuity of Risk Functionals with Applications to Stochastic Programming. 91-109 - Yurii E. Nesterov, Sebastian U. Stich:
Efficiency of the Accelerated Coordinate Descent Method on Structured Optimization Problems. 110-123 - Bo Wen, Xiaojun Chen, Ting Kei Pong:
Linear Convergence of Proximal Gradient Algorithm with Extrapolation for a Class of Nonconvex Nonsmooth Minimization Problems. 124-145 - Gábor Pataki:
Bad Semidefinite Programs: They All Look the Same. 146-172 - Seyedehsomayeh Hosseini, André Uschmajew:
A Riemannian Gradient Sampling Algorithm for Nonsmooth Optimization on Manifolds. 173-189 - Nguyen Huy Chieu, Le Van Hien:
Computation of Graphical Derivative for a Class of Normal Cone Mappings under a Very Weak Condition. 190-204 - Mert Pilanci, Martin J. Wainwright:
Newton Sketch: A Near Linear-Time Optimization Algorithm with Linear-Quadratic Convergence. 205-245 - Emre Mengi:
A Support Function Based Algorithm for Optimization with Eigenvalue Constraints. 246-268 - Satoru Adachi, Satoru Iwata, Yuji Nakatsukasa, Akiko Takeda:
Solving the Trust-Region Subproblem By a Generalized Eigenvalue Problem. 269-291 - Bilian Chen, Simai He, Zhening Li, Shuzhong Zhang:
On New Classes of Nonnegative Symmetric Tensors. 292-318 - Robert M. Freund, Paul Grigas, Rahul Mazumder:
An Extended Frank-Wolfe Method with "In-Face" Directions, and Its Application to Low-Rank Matrix Completion. 319-346 - Etienne de Klerk, Roxana Hess, Monique Laurent:
Improved Convergence Rates for Lasserre-Type Hierarchies of Upper Bounds for Box-Constrained Polynomial Optimization. 347-367 - Kurt M. Anstreicher:
Kronecker Product Constraints with an Application to the Two-Trust-Region Subproblem. 368-378 - Max L. N. Gonçalves, Jefferson G. Melo, Renato D. C. Monteiro:
Improved Pointwise Iteration-Complexity of A Regularized ADMM and of a Regularized Non-Euclidean HPE Framework. 379-407 - Jingwei Liang, Jalal Fadili, Gabriel Peyré:
Activity Identification and Local Linear Convergence of Forward-Backward-type Methods. 408-437 - Helmut Gfrerer, Boris S. Mordukhovich:
Robinson Stability of Parametric Constraint Systems via Variational Analysis. 438-465 - Sedi Bartz, Heinz H. Bauschke, Xianfu Wang:
The Resolvent Order: A Unification of the Orders by Zarantonello, by Loewner, and by Moreau. 466-477 - Geovani Nunes Grapiglia, Yurii E. Nesterov:
Regularized Newton Methods for Minimizing Functions with Hölder Continuous Hessians. 478-506 - Heinz H. Bauschke, Minh N. Dao:
On the Finite Convergence of the Douglas-Rachford Algorithm for Solving (Not Necessarily Convex) Feasibility Problems in Euclidean Spaces. 507-537 - Vyacheslav Kungurtsev, Johannes Jäschke:
A Predictor-Corrector Path-Following Algorithm for Dual-Degenerate Parametric Optimization Problems. 538-564 - Shinsaku Sakaue, Akiko Takeda, Sunyoung Kim, Naoki Ito:
Exact Semidefinite Programming Relaxations with Truncated Moment Matrix for Binary Polynomial Optimization Problems. 565-582
Volume 27, Number 2, 2017
- Sahar Karimi, Stephen A. Vavasis:
IMRO: A Proximal Quasi-Newton Method for Solving ℓ1-Regularized Least Squares Problems. 583-615 - Nicholas Boyd, Geoffrey Schiebinger, Benjamin Recht:
The Alternating Descent Conditional Gradient Method for Sparse Inverse Problems. 616-639 - Shoham Sabach, Shimrit Shtern:
A First Order Method for Solving Convex Bilevel Optimization Problems. 640-660 - Szilárd László:
Minimax Results on Dense Sets and Dense Families of Functionals. 661-685 - Alfredo N. Iusem, Alejandro Jofré, Roberto Imbuzeiro Oliveira, Philip Thompson:
Extragradient Method with Variance Reduction for Stochastic Variational Inequalities. 686-724 - Ramtin Madani, Somayeh Sojoudi, Ghazal Fazelnia, Javad Lavaei:
Finding Low-rank Solutions of Sparse Linear Matrix Inequalities using Convex Optimization. 725-758 - Hao Yu, Michael J. Neely:
A Simple Parallel Algorithm with an O(1/t) Convergence Rate for General Convex Programs. 759-783 - Shaoyan Guo, Huifu Xu, Liwei Zhang:
Convergence Analysis for Mathematical Programs with Distributionally Robust Chance Constraint. 784-816 - Timothy C. Y. Chan, Philip Allen Mar:
Stability and Continuity in Robust Optimization. 817-841 - Helmut Gfrerer, Jane J. Ye:
New Constraint Qualifications for Mathematical Programs with Equilibrium Constraints via Variational Analysis. 842-865 - Amitabh Basu, Timm Oertel:
Centerpoints: A Link between Optimization and Convex Geometry. 866-889 - Jianhua Yuan, Meiling Wang, Wenbao Ai, Tianping Shuai:
New Results on Narrowing the Duality Gap of the Extended Celis-Dennis-Tapia Problem. 890-909 - Orizon Pereira Ferreira, Gilson N. Silva:
Kantorovich's Theorem on Newton's Method for Solving Strongly Regular Generalized Equation. 910-926 - Xiao Wang, Shiqian Ma, Donald Goldfarb, Wei Liu:
Stochastic Quasi-Newton Methods for Nonconvex Stochastic Optimization. 927-956 - Yongchao Liu, Rudabeh Meskarian, Huifu Xu:
Distributionally Robust Reward-Risk Ratio Optimization with Moment Constraints. 957-985 - Shin-ichi Tanigawa:
Singularity Degree of the Positive Semidefinite Matrix Completion Problem. 986-1009 - Regina Sandra Burachik, C. Yalçin Kaya, M. M. Rizvi:
A New Scalarization Technique and New Algorithms to Generate Pareto Fronts. 1010-1034 - Mert Gürbüzbalaban, Asuman E. Ozdaglar, Pablo A. Parrilo:
On the Convergence Rate of Incremental Aggregated Gradient Algorithms. 1035-1048 - Ernesto G. Birgin, José Mario Martínez:
The Use of Quadratic Regularization with a Cubic Descent Condition for Unconstrained Optimization. 1049-1074 - Nguyen Dinh, Tran Hong Mo, Guy Vallet, Michel Volle:
A Unified Approach to Robust Farkas-Type Results with Applications to Robust Optimization Problems. 1075-1101 - Yu Du, Xiaodong Lin, Andrzej Ruszczynski:
A Selective Linearization Method For Multiblock Convex Optimization. 1102-1117 - Johannes O. Royset, Roger J.-B. Wets:
Variational Theory for Optimization under Stochastic Ambiguity. 1118-1149 - Jen-Chih Yao, Xi Yin Zheng, Jiangxing Zhu:
Stable Minimizers of φ-Regular Functions. 1150-1170 - Dragana Bajovic, Dusan Jakovetic, Natasa Krejic, Natasa Krklec Jerinkic:
Newton-like Method with Diagonal Correction for Distributed Optimization. 1171-1203 - Marius Durea, Marian Pantiruc, Radu Strugariu:
A New Type of Directional Regularity for Mappings and Applications to Optimization. 1204-1229 - Abdelmalek Aboussoror, Samir Adly, F. E. Saissi:
An Extended Fenchel-Lagrange Duality Approach and Optimality Conditions for Strong Bilevel Programming Problems. 1230-1255
Volume 27, Number 3, 2017
- Frank Permenter, Henrik A. Friberg, Erling D. Andersen:
Solving Conic Optimization Problems via Self-Dual Embedding and Facial Reduction: A Unified Approach. 1257-1282 - Adrien B. Taylor, Julien M. Hendrickx, François Glineur:
Exact Worst-Case Performance of First-Order Methods for Composite Convex Optimization. 1283-1313 - Christian Clason, Tuomo Valkonen:
Primal-Dual Extragradient Methods for Nonlinear Nonsmooth PDE-Constrained Optimization. 1314-1339 - Sanjeeb Dash, Oktay Günlük, Diego A. Morán R.:
On the Polyhedrality of Closures of Multibranch Split Sets and Other Polyhedra with Bounded Max-Facet-Width. 1340-1361 - Hsiao-Han Chao, Lieven Vandenberghe:
Semidefinite Representations of Gauge Functions for Structured Low-Rank Matrix Decomposition. 1362-1389 - M. Seetharama Gowda, Juyoung Jeong:
Commutation Principles in Euclidean Jordan Algebras and Normal Decomposition Systems. 1390-1402 - Lizhi Wang, Pan Xu:
The Watermelon Algorithm for The Bilevel Integer Linear Programming Problem. 1403-1430 - Victor I. Kolobov, Simeon Reich, Rafal Zalas:
Weak, Strong, and Linear Convergence of a Double-Layer Fixed Point Algorithm. 1431-1458 - Yangyang Xu:
Accelerated First-Order Primal-Dual Proximal Methods for Linearly Constrained Composite Convex Programming. 1459-1484 - Nam Ho-Nguyen, Fatma Kilinç-Karzan:
A Second-Order Cone Based Approach for Solving the Trust-Region Subproblem and Its Variants. 1485-1512 - Nadav Dym, Yaron Lipman:
Exact Recovery with Symmetries for Procrustes Matching. 1513-1530 - Baiyi Wu, Xiaoling Sun, Duan Li, Xiaojin Zheng:
Quadratic Convex Reformulations for Semicontinuous Quadratic Programming. 1531-1553 - Martin Gairing, Tobias Harks, Max Klimm:
Complexity and Approximation of the Continuous Network Design Problem. 1554-1582 - Tianyi Chen, Frank E. Curtis, Daniel P. Robinson:
A Reduced-Space Algorithm for Minimizing ℓ1-Regularized Convex Functions. 1583-1610 - Björn Geißler, Antonio Morsi, Lars Schewe, Martin Schmidt:
Penalty Alternating Direction Methods for Mixed-Integer Optimization: A New View on Feasibility Pumps. 1611-1636 - Miju Ahn, Jong-Shi Pang, Jack Xin:
Difference-of-Convex Learning: Directional Stationarity, Optimality, and Sparsity. 1637-1665 - Jordi Castro, Stefano Nasini:
On Geometrical Properties of Preconditioners in IPMs for Classes of Block-Angular Problems. 1666-1693 - Dimitri P. Bertsekas:
Regular Policies in Abstract Dynamic Programming. 1694-1727 - Jiawang Nie, Li Wang, Jane J. Ye:
Bilevel Polynomial Programs and Semidefinite Relaxation Methods. 1728-1757 - Krzysztof Rutkowski:
Closed-Form Expressions for Projectors onto Polyhedral Sets in Hilbert Spaces. 1758-1771 - Burhaneddin Sandikçi, Osman Y. Özaltin:
A Scalable Bounding Method for Multistage Stochastic Programs. 1772-1800 - Danial Davarnia, Jean-Philippe P. Richard, Mohit Tawarmalani:
Simultaneous Convexification of Bilinear Functions over Polytopes with Application to Network Interdiction. 1801-1833 - Abebe Geletu, Armin Hoffmann, Michael Klöppel, Pu Li:
An Inner-Outer Approximation Approach to Chance Constrained Optimization. 1834-1857 - Dávid Papp:
Semi-Infinite Programming using High-Degree Polynomial Interpolants and Semidefinite Programming. 1858-1879 - Soham R. Phade, Vivek S. Borkar:
A Distributed Boyle-Dykstra-Han Scheme. 1880-1897 - Yaroslav Shitov:
The Complexity of Positive Semidefinite Matrix Factorization. 1898-1909 - Zhaosong Lu:
Randomized Block Proximal Damped Newton Method for Composite Self-Concordant Minimization. 1910-1942 - Alper Atamtürk, Simge Küçükyavuz, Birce Tezel:
Path Cover and Path Pack Inequalities for the Capacitated Fixed-Charge Network Flow Problem. 1943-1976 - Mengdi Wang:
Vanishing Price of Decentralization in Large Coordinative Nonconvex Optimization. 1977-2009 - Archis Ghate:
Duality in Countably Infinite Monotropic Programs. 2010-2033 - Emmanuel Soubies, Laure Blanc-Féraud, Gilles Aubert:
A Unified View of Exact Continuous Penalties for ℓ2-ℓ0 Minimization. 2034-2060 - Gue Myung Lee, Tien Son Pham:
Generic Properties for Semialgebraic Programs. 2061-2084 - Robin Verschueren, Mario Zanon, Rien Quirynen, Moritz Diehl:
A Sparsity Preserving Convexification Procedure for Indefinite Quadratic Programs Arising in Direct Optimal Control. 2085-2109 - Lei-Hong Zhang, Chungen Shen, Ren-Cang Li:
On the Generalized Lanczos Trust-Region Method. 2110-2142 - Felipe Opazo, Jirí V. Outrata, Héctor Ramírez Cabrera:
Erratum: On The Aubin Property of Critical Points to Perturbed Second-Order Cone Programs. 2143-2151
Volume 27, Number 4, 2017
- Saverio Salzo:
The Variable Metric Forward-Backward Splitting Algorithm Under Mild Differentiability Assumptions. 2153-2181 - Pedro J. Zufiria, José Antonio Álvarez-Cubero:
Generalized Lexicographic MultiObjective Combinatorial Optimization. Application to Cryptography. 2182-2201 - Horia Mania, Xinghao Pan, Dimitris S. Papailiopoulos, Benjamin Recht, Kannan Ramchandran, Michael I. Jordan:
Perturbed Iterate Analysis for Asynchronous Stochastic Optimization. 2202-2229 - Jian Hu, Gevorg Stepanyan:
Optimization with Reference-Based Robust Preference Constraints. 2230-2257 - Alexander Shapiro:
Distributionally Robust Stochastic Programming. 2258-2275 - Samet Oymak, Mahdi Soltanolkotabi:
Fast and Reliable Parameter Estimation from Nonlinear Observations. 2276-2300 - Dmitriy Drusvyatskiy, Nathan Krislock, Yuen-Lam Voronin, Henry Wolkowicz:
Noisy Euclidean Distance Realization: Robust Facial Reduction and the Pareto Frontier. 2301-2331 - Ying Cui, Chao Ding, Xinyuan Zhao:
Quadratic Growth Conditions for Convex Matrix Optimization Problems Associated with Spectral Functions. 2332-2355 - Patrick L. Combettes, Lilian E. Glaudin:
Quasi-Nonexpansive Iterations on the Affine Hull of Orbits: From Mann's Mean Value Algorithm to Inertial Methods. 2356-2380 - Diego Cifuentes, Pablo A. Parrilo:
Sampling Algebraic Varieties for Sum of Squares Programs. 2381-2404 - César Gutiérrez, Gábor Kassay, Vicente Novo, Juan Luis Ródenas-Pedregosa:
Ekeland Variational Principles in Vector Equilibrium Problems. 2405-2425 - Huikang Liu, Man-Chung Yue, Anthony Man-Cho So:
On the Estimation Performance and Convergence Rate of the Generalized Power Method for Phase Synchronization. 2426-2446 - José Mario Martínez:
On High-order Model Regularization for Constrained Optimization. 2447-2458 - Noureddine Igbida, Van Thanh Nguyen, Julián Toledo:
On the Uniqueness and Numerical Approximations for a Matching Problem. 2459-2480 - Bogdan Grechuk, Michael Zabarankin:
Sensitivity Analysis in Applications with Deviation, Risk, Regret, and Error Measures. 2481-2507 - Jean-Paul Penot:
Higher-Order Optimality Conditions and Higher-Order Tangent Sets. 2508-2527 - Julio Backhoff, Mathias Beiglböck, Yiqing Lin, Anastasiia Zalashko:
Causal Transport in Discrete Time and Applications. 2528-2562 - Dorit S. Hochbaum, Cheng Lu:
A Faster Algorithm Solving a Generalization of Isotonic Median Regression and a Class of Fused Lasso Problems. 2563-2596 - Angelia Nedic, Alex Olshevsky, Wei Shi:
Achieving Geometric Convergence for Distributed Optimization Over Time-Varying Graphs. 2597-2633 - Amin Jalali, Maryam Fazel, Lin Xiao:
Variational Gram Functions: Convex Analysis and Optimization. 2634-2661
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-20 20:49 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:
