Journal: SIAM Journal on Optimization

Volume 19, Issue 4

1511 -- 1533Maria B. Chiarolla, Ulrich G. Haussmann. Multivariable Utility Functions
1534 -- 1558Jiawang Nie, James Demmel. Sparse SOS Relaxations for Minimizing Functions that are Summations of Small Polynomials
1559 -- 1573Etienne de Klerk, Dmitrii V. Pasechnik, Renata Sotirov. On Semidefinite Programming Relaxations of the Traveling Salesman Problem
1574 -- 1609Arkadi Nemirovski, Anatoli Juditsky, Guanghui Lan, Alexander Shapiro. Robust Stochastic Approximation Approach to Stochastic Programming
1610 -- 1632Sergio Conti, Harald Held, Martin Pach, Martin Rumpf, Rüdiger Schultz. Shape Optimization Under Uncertainty---A Stochastic Programming Perspective
1633 -- 1647W. H. Yang. Error Bounds for Convex Polynomials
1648 -- 1673Xi Yin Zheng, Kung Fu Ng. Calmness for L-Subsmooth Multifunctions in Banach Spaces
1674 -- 1693Jorge Nocedal, Andreas Wächter, Richard A. Waltz. Adaptive Barrier Update Strategies for Nonlinear Interior Methods
1694 -- 1718Gabriele Eichfelder. An Adaptive Scalarization Method in Multiobjective Optimization
1719 -- 1734Pierre Carpentier, Jean-Philippe Chancelier, Michel De Lara. Approximations of Stochastic Optimization Problems Subject to Measurability Constraints
1735 -- 1756Wenbao Ai, Shuzhong Zhang. Strong Duality for the CDT Subproblem: A Necessary and Sufficient Condition
1757 -- 1780Angelia Nedic, Asuman E. Ozdaglar. Approximate Primal Solutions and Rate Analysis for Dual Subgradient Methods
1781 -- 1806Gergely Mádi-Nagy. On Multivariate Discrete Moment Problems: Generalization of the Bivariate Min Algorithm for Higher Dimensions
1807 -- 1827Zhaosong Lu. Smooth Optimization Approach for Sparse Covariance Selection
1828 -- 1845Nicolas Bissantz, Lutz Dümbgen, Axel Munk, Bernd Stratmann. Convergence Analysis of Generalized Iteratively Reweighted Least Squares Algorithms on Convex Function Spaces
1846 -- 1880Sanjay Mehrotra, M. Gökhan Özevin. On the Implementation of Interior Point Decomposition Algorithms for Two-Stage Stochastic Conic Programs
1881 -- 1893Hideaki Iiduka, Isao Yamada. A Use of Conjugate Gradient Direction for the Convex Optimization Problem over the Fixed Point Set of a Nonexpansive Mapping
1894 -- 1917A. D. Ioffe. An Invitation to Tame Optimization
1918 -- 1946Guanghui Lan, Renato D. C. Monteiro, Takashi Tsuchiya. A Polynomial Predictor-Corrector Trust-Region Algorithm for Linear Programming
1947 -- 1969Achiya Dax. A New Class of Minimum Norm Duality Theorems
1970 -- 1994Mounir El Maghri, Mohamed Laghdir. Pareto Subdifferential Calculus for Convex Vector Mappings and Applications to Vector Optimization
1995 -- 2014Jean B. Lasserre. Convexity in SemiAlgebraic Geometry and Polynomial Optimization

Volume 19, Issue 3

1003 -- 1027Alexey F. Izmailov, Mikhail V. Solodov. An Active-Set Newton Method for Mathematical Programs with Complementarity Constraints
1028 -- 1047Lingchen Kong, Jie Sun, Naihua Xiu. A Regularized Smoothing Newton Method for Symmetric Cone Complementarity Problems
1048 -- 1072Adrian S. Lewis, C. H. Jeffrey Pang. Variational Analysis of Pseudospectra
1073 -- 1092Alexandre Belloni, Robert M. Freund. On the Second-Order Feasibility Cone: Primal-Dual Representation and Efficient Projection
1093 -- 1106Andrzej Cegielski, Agnieszka Suchocka. Relaxed Alternating Projection Methods
1107 -- 1130Elaine T. Hale, Wotao Yin, Yin Zhang. Fixed-Point Continuation for l::1::-Minimization: Methodology and Convergence
1131 -- 1149David Hartvigsen, Yanjun Li. Polyhedral Results for 1-Restricted Simple 2-Matchings
1150 -- 1170Charles Audet, J. E. Dennis, Sébastien Le Digabel. Parallel Space Decomposition of the Mesh Adaptive Direct Search Algorithm
1184 -- 1210Jacek Gondzio, Andreas Grothey. A New Unblocking Technique to Warmstart Interior Point Methods Based on Sensitivity Analysis
1211 -- 1230Marco C. Campi, Simone Garatti. The Exact Feasibility of Randomized Solutions of Uncertain Convex Programs
1231 -- 1249Ademir A. Ribeiro, Elizabeth W. Karas, Clovis C. Gonzaga. Global Convergence of Filter Methods for Nonlinear Programming
1250 -- 1269Marc Quincampoix, Nadia Zlateva. Parameterized Minimax Problem: On Lipschitz-Like Dependence of the Solution with Respect to the Parameter
1270 -- 1298Leah Epstein, Asaf Levin. On Bin Packing with Conflicts
1299 -- 1325Roberto H. Bielschowsky, Francisco A. M. Gomes. Dynamic Control of Infeasibility in Equality Constrained Optimization
1326 -- 1343Gábor Rudolf, Andrzej Ruszczynski. Optimization Problems with Second Order Stochastic Dominance Constraints: Duality, Compact Formulations, and Cut Generation Methods
1344 -- 1367Seung-Jean Kim, Stephen P. Boyd. A Minimax Theorem with Applications to Machine Learning, Signal Processing, and Finance
1368 -- 1391E. Alper Yildirim. Two Algorithms for the Minimum Enclosing Ball Problem
1392 -- 1396S. Damla Ahipasaoglu, E. Alper Yildirim. Identification and Elimination of Interior Points for the Minimum Enclosing Ball Problem
1397 -- 1416Amir Beck, Marc Teboulle, Zahar Chikishev. Iterative Minimization Schemes for Solving the Single Source Localization Problem
1417 -- 1432Anton Schiela. A Simplified Approach to Semismooth Newton Methods in Function Space
1433 -- 1450James Luedtke. New Formulations for Optimization under Stochastic Dominance Constraints
1451 -- 1466Matthias Jach, Dennis Michaels, Robert Weismantel. The Convex Envelope of (n--1)-Convex Functions
1467 -- 1488Silvia Vogel. Universal Confidence Sets for Solutions of Optimization Problems
1489 -- 1509Guoyin Li, Kung Fu Ng. On Extension of Fenchel Duality and its Application

Volume 19, Issue 2

503 -- 523Simai He, Zhi-Quan Luo, Jiawang Nie, Shuzhong Zhang. Semidefinite Relaxation Bounds for Indefinite Homogeneous Quadratic Optimization
524 -- 551Tito Homem-de-Mello. On Rates of Convergence for Stochastic Optimization Problems Under Non--Independent and Identically Distributed Sampling
552 -- 571Ralf Gollmer, Frederike Neise, Rüdiger Schultz. Stochastic Programs with First-Order Dominance Constraints Induced by Mixed-Integer Linear Recourse
572 -- 591Nebojsa Gvozdenovic, Monique Laurent. The Operator Psi for the Chromatic Number of a Graph
592 -- 615Nebojsa Gvozdenovic, Monique Laurent. Computing Semidefinite Programming Lower Bounds for the (Fractional) Chromatic Number Via Block-Diagonalization
616 -- 643Eduardo Casas, Juan Carlos de los Reyes, Fredi Tröltzsch. Sufficient Second-Order Optimality Conditions for Semilinear Control Problems with Pointwise State Constraints
644 -- 654Harald Günzel, Hubertus Th. Jongen, Jan-J. Rückmann. On Stable Feasible Sets in Generalized Semi-infinite Programming
655 -- 673Zizhuo Wang, Song Zheng, Yinyu Ye, Stephen Boyd. Further Relaxations of the Semidefinite Programming Approach to Sensor Network Localization
674 -- 699James Luedtke, Shabbir Ahmed. A Sample Approximation Approach for Optimization with Probabilistic Constraints
700 -- 713Dinh The Luc, Roger J.-B. Wets. Outer Semicontinuity of Positive Hull Mappings with Application to Semi-Infinite and Stochastic Programming
714 -- 739D. Russell Luke. Finding Best Approximation Pairs Relative to a Convex and Prox-Regular Set in a Hilbert Space
740 -- 755Louis A. Romero, Jeff Mason. Pitchfork Bifurcations in Nonlinear Least Squares Problems--Applications to TOA Geolocation
756 -- 765Kristin Winkler. A Characterization of Efficient and Weakly Efficient Points in Convex Vector Optimization
766 -- 785Heinz H. Bauschke, Rafal Goebel, Yves Lucet, Xianfu Wang. The Proximal Average: Basic Theory
786 -- 807Dan Butnariu, Yair Censor, Pini Gurfil, Ethan Hadar. On The Behavior of Subgradient Projections Methods for Convex Feasibility Problems in Euclidean Spaces
808 -- 823Florian Jarre, Franz Rendl. An Augmented Primal-Dual Method for Linear Conic Programs
824 -- 835Fumiaki Kohsaka, Wataru Takahashi. Existence and Approximation of Fixed Points of Firmly Nonexpansive-Type Mappings in Banach Spaces
836 -- 845Frank Heyde, Andreas Löhne. Geometric Duality in Multiple Objective Linear Programming
846 -- 862Radek Kucera. Convergence Rate of an Optimization Algorithm for Minimizing Quadratic Functions with Separable Convex Constraints
863 -- 882Abderrahim Hantoute, Marco A. López, Constantin Zalinescu. Subdifferential Calculus Rules in Convex Analysis: A Unifying Approach Via Pointwise Supremum Functions
883 -- 910Shaohua Pan, Jein-Shan Chen. A Class of Interior Proximal-Like Algorithms for Convex Second-Order Cone Programming
911 -- 940Hariharan Lakshmanan, Daniela Pucci de Farias. Decentralized Resource Allocation in Dynamic Networks of Agents
941 -- 951Hà Huy Vui, Pham Tien So'n. Global Optimization of Polynomials Using the Truncated Tangency Variety and Sums of Squares
952 -- 968Christian Küchler. On Stability of Multistage Stochastic Programs
969 -- 1001Bogdan I. Gavrea, Mihai Anitescu, Florian A. Potra. Convergence of a Class of Semi-Implicit Time-Stepping Schemes for Nonsmooth Rigid Multibody Dynamics

Volume 19, Issue 1

1 -- 20Huynh van Ngai, Michel Théra. Error Bounds in Metric Spaces and Application to the Perturbation Stability of Metric Regularity
21 -- 38Marc E. Pfetsch. Branch-and-Cut for the Maximum Feasible Subsystem Problem
39 -- 61Fanwen Meng, Gongyun Zhao, Mark Goh, Robert de Souza. Lagrangian-Dual Functions and Moreau--Yosida Regularization
62 -- 76Xi Yin Zheng, Kung Fu Ng. Linear Regularity for a Collection of Subsmooth Sets in Banach Spaces
77 -- 113Alexander Mitsos, Panayiotis Lemonidis, Cha Kun Lee, Paul I. Barton. Relaxation-Based Bounds for Semi-Infinite Programs
114 -- 143Florian A. Potra. Primal-Dual Affine Scaling Interior Point Methods for Linear Complementarity Problems
144 -- 162Jing-Hui Qiu. Dual Characterization and Scalarization for Benson Proper Efficiency
163 -- 187Chong Li, K. F. Ng, T. K. Pong. Constraint Qualifications for Convex Inequality Systems with Applications in Constrained Optimization
188 -- 210Charles Audet, Gilles Savard, Walid Zghal. Multiobjective Optimization Through a Series of Single-Objective Formulations
211 -- 216Francesca Faraci, Antonio Iannizzotto. Well Posed Optimization Problems and Nonconvex Chebyshev Sets in Hilbert Spaces
217 -- 233Radu Ioan Bot, Ernö Robert Csetnek, Gert Wanka. Regularity Conditions via Quasi-Relative Interior in Convex Programming
234 -- 239David Bartl. A Short Algebraic Proof of the Farkas Lemma
240 -- 260Lisandro A. Parente, Pablo A. Lotito, Mikhail V. Solodov. A Class of Inexact Variable Metric Proximal Point Algorithms
261 -- 280Dennis Cheung, Felipe Cucker, Javier Peña. A Condition Number for Multifold Conic Systems
281 -- 306Pierre Apkarian, Dominikus Noll, O. Prot. A Trust Region Spectral Bundle Method for Nonconvex Eigenvalue Optimization
307 -- 325Andrea Walther. A First-Order Convergence Analysis of Trust-Region Methods with Inexact Jacobians
326 -- 350Matthias Gerdts. Global Convergence of a Nonsmooth Newton Method for Control-State Constrained Optimal Control Problems
351 -- 369Richard H. Byrd, Frank E. Curtis, Jorge Nocedal. An Inexact SQP Method for Equality Constrained Optimization
370 -- 396Zi Xian Chan, Defeng Sun. Constraint Nondegeneracy, Strong Regularity, and Nonsingularity in Semidefinite Programming
397 -- 413Paul-Emile Maingé, Abdellatif Moudafi. Convergence of New Inertial Proximal Methods for DC Programming
414 -- 444Serge Gratton, Annick Sartenaer, Philippe L. Toint. Recursive Trust-Region Methods for Multiscale Nonlinear Optimization
445 -- 471Jing Hu, John E. Mitchell, Jong-Shi Pang, Kristin P. Bennett, Gautam Kunapuli. On the Global Solution of Linear Programs with Linear Complementarity Constraints
472 -- 501Frank Göring, Christoph Helmberg, Markus Wappler. Embedded in the Shadow of the Separator