| 2755 | -- | 2787 | Renato D. C. Monteiro, Benar Fux Svaiter. On the Complexity of the Hybrid Proximal Extragradient Method for the Iterates and the Ergodic Mean |
| 2788 | -- | 2806 | María J. Cánovas, Marco A. López, Boris S. Mordukhovich, Juan Parra. Variational Analysis in Semi-Infinite and Infinite Programming, II: Necessary Optimality Conditions |
| 2807 | -- | 2832 | Shai Shalev-Shwartz, Nathan Srebro, Tong Zhang. Trading Accuracy for Sparsity in Optimization Problems with Sparsity Constraints |
| 2833 | -- | 2852 | Coralia Cartis, Nicholas I. M. Gould, Philippe L. Toint. On the Complexity of Steepest Descent, Newton s and Regularized Newton s Methods for Nonconvex Unconstrained Optimization Problems |
| 2853 | -- | 2875 | Yang Li, Tamás Terlaky. A New Class of Large Neighborhood Path-Following Interior Point Algorithms for Semidefinite Optimization with O(/sqrt{n}/log/frac{/mathrm{Tr}(X^0S^0)}{/epsilon}) Iteration Complexity |
| 2876 | -- | 2889 | Mohab Safey El Din, Lihong Zhi. Computing Rational Points in Convex Semialgebraic Sets and Sum of Squares Decompositions |
| 2890 | -- | 2912 | Santanu S. Dey, Laurence A. Wolsey. Constrained Infinite Group Relaxations of MIPs |
| 2913 | -- | 2938 | Zdenek Dostál, Radek Kucera. An Optimal Algorithm for Minimization of Quadratic Functions with Bounded Spectrum Subject to Separable Convex Inequality and Linear Equality Constraints |
| 2939 | -- | 2958 | Daniel Gourion, Dinh The Luc. Finding Efficient Solutions by Free Disposal Outer Approximation |
| 2959 | -- | 2977 | Liping Zhang, Soon-Yi Wu, Marco A. López. A New Exchange Method for Convex Semi-Infinite Programming |
| 2978 | -- | 2993 | Iskander Aliev, Martin Henk. Feasibility of Integer Knapsacks |
| 2994 | -- | 3013 | Chengjing Wang, Defeng Sun, Kim-Chuan Toh. Solving Log-Determinant Optimization Problems by a Newton-CG Primal Proximal Point Algorithm |
| 3014 | -- | 3039 | G. Lesaja, C. Roos. Unified Analysis of Kernel-Based Interior-Point Methods for P::*(Kappa)::-Linear Complementarity Problems |
| 3040 | -- | 3058 | Luc Barbet, Aris Daniilidis, Pierpaolo Soravia. Generalized Hessians of C:::1, 1:::-Functions and Second-Order Viscosity Subjets |
| 3059 | -- | 3081 | Zhisu Zhu, Anthony Man-Cho So, Yinyu Ye. Universal Rigidity and Edge Sparsification for Sensor Network Localization |
| 3082 | -- | 3103 | Hà Huy Vui, Pham Tien So'n. Representations of Positive Polynomials and Optimization on Noncompact Semialgebraic Sets |
| 3104 | -- | 3120 | Etienne de Klerk, Monique Laurent. Error Bounds for Some Semidefinite Programming Approaches to Polynomial Minimization on the Hypercube |
| 3121 | -- | 3145 | Leah Epstein, Asaf Levin. AFPTAS Results for Common Variants of Bin Packing: A New Method for Handling the Small Items |
| 3146 | -- | 3160 | Emanuele Casini, Enrico Miglierina. The Geometry of Strict Maximality |
| 3161 | -- | 3184 | Chi-Kong Ng, Duan Li, Lian-sheng Zhang. Global Descent Method for Global Optimization |
| 3185 | -- | 3207 | Fabrizio Dabbene, P. S. Shcherbakov, Boris T. Polyak. A Randomized Cutting Plane Method with Probabilistic Geometric Convergence |
| 3208 | -- | 3231 | K. W. Meng, X. Q. Yang. Optimality Conditions via Exact Penalty Functions |
| 3232 | -- | 3259 | Alfred Auslender, Ron Shefi, Marc Teboulle. A Moving Balls Approximation Method for a Class of Smooth Constrained Minimization Problems |
| 3260 | -- | 3279 | Damon Mosk-Aoyama, Tim Roughgarden, Devavrat Shah. Fully Distributed Algorithms for Convex Optimization Problems |
| 3280 | -- | 3296 | Alexander Kruger, Huynh van Ngai, Michel Théra. Stability of Error Bounds for Convex Constraint Systems in Banach Spaces |
| 3297 | -- | 3311 | Christoph Buchheim, Dennis Michaels, Robert Weismantel. Integer Programming Subject to Monomial Constraints |
| 3312 | -- | 3334 | D. Fernández, Alexey F. Izmailov, Mikhail V. Solodov. Sharp Primal Superlinear Convergence Results for Some Newtonian Methods for Constrained Optimization |
| 3335 | -- | 3363 | Hiroshi Yamashita, Takahito Tanabe. A Primal-Dual Exterior Point Method for Nonlinear Optimization |
| 3364 | -- | 3383 | Jean B. Lasserre, Mihai Putinar. Positivity and Optimization for Semi-Algebraic Functions |
| 3384 | -- | 3407 | V. Jeyakumar, G. Y. Li. Strong Duality in Robust Convex Programming: Complete Characterizations |
| 3408 | -- | 3426 | Hans D. Mittelmann, Jiming Peng. Estimating Bounds for Quadratic Assignment Problems Associated with Hamming and Manhattan Distance Matrices Based on Semidefinite Programming |
| 3427 | -- | 3464 | Giuseppe Carlo Calafiore. Random Convex Programs |
| 3465 | -- | 3489 | Ting Kei Pong, Paul Tseng, Shuiwang Ji, Jieping Ye. Trace Norm Regularization: Reformulations, Algorithms, and Multi-Task Learning |
| 3490 | -- | 3511 | Boris S. Mordukhovich, Javier Peña, Vera Roshchina. Applying Metric Regularity to Compute a Condition Measure of a Smoothing Algorithm for Matrix Games |
| 3512 | -- | 3532 | Katya Scheinberg, Philippe L. Toint. Self-Correcting Geometry in Model-Based Algorithms for Derivative-Free Unconstrained Optimization |
| 3533 | -- | 3554 | Roberto Andreani, José Mario Martínez, Benar Fux Svaiter. A New Sequential Optimality Condition for Constrained Optimization and Algorithmic Consequences |
| 3555 | -- | 3576 | Hongchao Zhang, Andrew R. Conn, Katya Scheinberg. A Derivative-Free Algorithm for Least-Squares Minimization |