default search action
SIAM Journal on Optimization, Volume 23
Volume 23, Number 1, 2013
- Hideaki Iiduka
:
Fixed Point Optimization Algorithms for Distributed Optimization in Networked Systems. 1-26 - Stephen C. Billups
Derivative-Free Optimization of Expensive Functions with Computational Error Using Weighted Regression. 27-53 - Rafael Correa, Abderrahim Hantoute:
Lower Semicontinuous Convex Relaxation in Optimization. 54-73 - Adrian S. Lewis, Shanshan Zhang:
Partial Smoothness, Tilt Stability, and Generalized Hessians. 74-94 - Dinh Quoc Tran, Ion Necoara, Carlo Savorgnan, Moritz Diehl:
An Inexact Perturbed Path-Following Method for Lagrangian Decomposition in Large-Scale Separable Convex Optimization. 95-125 - Konstantinos Slavakis, Isao Yamada:
The Adaptive Projected Subgradient Method Constrained by Families of Quasi-nonexpansive Mappings and Its Application to Online Learning. 126-152 - Fabián Flores Bazán
Strong Duality in Cone Constrained Nonconvex Optimization. 153-169 - Alexander J. Zaslavski:
Exact Penalty Property in Optimization with Mixed Constraints via Variational Analysis. 170-187 - Hiroyuki Sato
A Riemannian Optimization Approach to the Matrix Singular Value Decomposition. 188-212 - Alekh Agarwal, Dean P. Foster, Daniel J. Hsu, Sham M. Kakade, Alexander Rakhlin:
Stochastic Convex Optimization with Bandit Feedback. 213-240 - Gabriela Jeronimo, Daniel Perrucci, Elias P. Tsigaridas:
On the Minimum of a Polynomial Function on a Basic Closed Semialgebraic Set and Applications. 241-255 - Dmitriy Drusvyatskiy, Adrian S. Lewis:
Tilt Stability, Uniform Quadratic Growth, and Strong Metric Regularity of the Subdifferential. 256-267 - Arvind U. Raghunathan:
Global Optimization of Nonlinear Network Design. 268-295 - Yu-Hong Dai, Cai-Xia Kou:
A Nonlinear Conjugate Gradient Algorithm with an Optimal Property and an Improved Wolfe Line Search. 296-320 - Roland Herzog
B- and Strong Stationarity for Optimal Control of Static Plasticity with Hardening. 321-352 - Wolfram Wiesemann, Angelos Tsoukalas
Pessimistic Bilevel Optimization. 353-380 - Darinka Dentcheva, Andrzej Ruszczynski:
Common Mathematical Foundations of Expected Utility and Dual Utility Theories. 381-405 - Boris S. Mordukhovich, Tran T. A. Nghia:
Subdifferentials of Nonconvex Supremum Functions and Their Applications to Semi-infinite and Infinite Programs with Lipschitzian Data. 406-431 - Samuel Burer, Kurt M. Anstreicher:
Second-Order-Cone Constraints for Extended Trust-Region Subproblems. 432-451 - Dominik Dorsch, Hubertus Th. Jongen, Vladimir Shikhman:
On Structure and Computation of Generalized Nash Equilibria. 452-474 - Renato D. C. Monteiro, Benar Fux Svaiter
Iteration-Complexity of Block-Decomposition Algorithms and the Alternating Direction Method of Multipliers. 475-507 - Daniela Lera, Yaroslav D. Sergeyev
Acceleration of Univariate Global Optimization Algorithms Working with Lipschitz Functions and Lipschitz First Derivatives. 508-529 - Alois Pichler
Evaluations of Risk Measures for Different Probability Measures. 530-551 - Alexandre Cabot, Lionel Thibault:
Inclusion of Subdifferentials, Linear Well-Conditioning, and Steepest Descent Equation. 552-575 - Ankan Saha, Ambuj Tewari:
On the Nonasymptotic Convergence of Cyclic Coordinate Descent Methods. 576-601 - Hailin Sun
Exact Penalization, Level Function Method, and Modified Cutting-Plane Method for Stochastic Programs with Second Order Stochastic Dominance Constraints. 602-631 - Helmut Gfrerer
On Directional Metric Subregularity and Second-Order Optimality Conditions for a Class of Nonsmooth Mathematical Programs. 632-665 - Jane J. Ye
Minimizing the Condition Number to Construct Design Points for Polynomial Regression Models. 666-686
Volume 23, Number 2, 2013
- Héctor Ramírez, Alberto Seeger, David Sossa:
Commutation Principle for Variational Problems on Euclidean Jordan Algebras. 687-694 - Laurent Sorber, Marc Van Barel
Optimization-Based Algorithms for Tensor Decompositions: Canonical Polyadic Decomposition, Decomposition in Rank-(Lr, Lr, 1) Terms, and a New Generalization. 695-720 - Akshay Gupte
Solving Mixed Integer Bilinear Problems Using MILP Formulations. 721-744 - Chek Beng Chua
A Barrier-Based Smoothing Proximal Point Algorithm for NCPs over Closed Convex Cones. 745-769 - Christian Kanzow, Alexandra Schwartz
A New Regularization Method for Mathematical Programs with Complementarity Constraints with Strong Convergence Properties. 770-798 - Dennis Cheung, Felipe Cucker
On the Average Condition of Random Linear Programs. 799-810 - Amir Ali Ahmadi, Pablo A. Parrilo
A Complete Characterization of the Gap between Convexity and SOS-Convexity. 811-833 - Frank Göring
On Minimizing the Spectral Width of Graph Laplacians and Associated Graph Realizations. 834-856 - Junfeng Yang, Defeng Sun
A Proximal Point Algorithm for Log-Determinant Optimization with Group Lasso Regularization. 857-893 - Ming Hu, Masao Fukushima:
Existence, Uniqueness, and Computation of Robust Nash Equilibria in a Class of Multi-Leader-Follower Games. 894-916 - Hà Huy Vui:
Global Hölderian Error Bound for Nondegenerate Polynomials. 917-933 - Michel Baes, Michael Bürgisser, Arkadi Nemirovski
A Randomized Mirror-Prox Method for Solving Structured Large-Scale Matrix Saddle-Point Problems. 934-962 - Sanjay Mehrotra, Dávid Papp
Generating Moment Matching Scenarios Using Optimization Techniques. 963-999 - Kai Kellner, Thorsten Theobald
Containment Problems for Polytopes and Spectrahedra. 1000-1020 - Amitabh Basu
A (k+1)-Slope Theorem for the k-Dimensional Infinite Group Relaxation. 1021-1040 - Peter Fusek:
On Metric Regularity for Weakly Almost Piecewise Smooth Functions and Some Applications in Nonlinear Semidefinite Programming. 1041-1061 - Lin Xiao, Tong Zhang:
A Proximal-Gradient Homotopy Method for the Sparse Least-Squares Problem. 1062-1091 - Renato D. C. Monteiro, Benar Fux Svaiter
An Accelerated Hybrid Proximal Extragradient Method for Convex Optimization and Its Implications to Second-Order Methods. 1092-1125 - Meisam Razaviyayn, Mingyi Hong, Zhi-Quan Luo:
A Unified Convergence Analysis of Block Successive Minimization Methods for Nonsmooth Optimization. 1126-1153 - Rafael Correa, Pedro Gajardo
Existence of Minimizers on Drops. 1154-1166 - Layne T. Watson, Stephen C. Billups
A Globally Convergent Probability-One Homotopy for Linear Programs with Linear Complementarity Constraints. 1167-1188 - Luis Felipe Bueno, Ana Friedlander, José Mario Martínez
Inexact Restoration Method for Derivative-Free Optimization with Smooth Constraints. 1189-1213 - Bart Vandereycken
Low-Rank Matrix Completion by Riemannian Optimization. 1214-1236 - Chong Li, Kung Fu Ng:
Approximate Solutions for Abstract Inequality Systems. 1237-1256 - J. Carsten Ziems:
Adaptive Multilevel Inexact SQP-Methods for PDE-Constrained Optimization with Control Constraints. 1257-1283 - Sebastian U. Stich, Christian L. Müller, Bernd Gärtner:
Optimization of Convex Functions with Random Pursuit. 1284-1309 - Leah Epstein, Asaf Levin
Robust Approximation Schemes for Cube Packing. 1310-1343 - Yao Yue, Karl Meerbergen
Accelerating Optimization of Parametric Linear Systems by Model Order Reduction. 1344-1370
Volume 23, Number 3, 2013
- Daniel P. Robinson, Liming Feng, Jorge Nocedal, Jong-Shi Pang:
Subspace Accelerated Matrix Splitting Algorithms for Asymmetric and Symmetric Linear Complementarity Problems. 1371-1397 - Dávid Papp
Semidefinite Characterization of Sum-of-Squares Cones in Algebras. 1398-1423 - Michael Möller, Martin Burger:
Multiscale Methods for Polyhedral Regularizations. 1424-1456 - James V. Burke, Tim Hoheisel:
Epi-convergent Smoothing with Applications to Convex Composite Functions. 1457-1479 - Amir Beck, Yonina C. Eldar:
Sparsity Constrained Nonlinear Optimization: Optimality Conditions and Algorithms. 1480-1509 - Jacek Gondzio
Convergence Analysis of an Inexact Feasible Interior Point Method for Convex Quadratic Programming. 1510-1527 - Xiaojun Chen
Optimality Conditions and a Smoothing Trust Region Newton Method for NonLipschitz Optimization. 1528-1552 - Coralia Cartis, Nicholas I. M. Gould
On the Evaluation Complexity of Cubic Regularization Methods for Potentially Rank-Deficient Nonlinear Least-Squares Problems and Its Relevance to Constrained Nonlinear Optimization. 1553-1574 - Marianna De Santis
A New Class of Functions for Measuring Solution Integrality in the Feasibility Pump Approach. 1575-1606 - Silvia Villa
Accelerated and Inexact Forward-Backward Algorithms. 1607-1633 - Jiawang Nie:
Polynomial Optimization with Real Varieties. 1634-1646 - Xiaojun Chen
Convergence of Regularized Time-Stepping Methods for Differential Variational Inequalities. 1647-1671 - Darinka Dentcheva, Werner Römisch:
Stability and Sensitivity of Stochastic Dominance Constrained Optimization Models. 1672-1688 - Aleksandr Y. Aravkin, James V. Burke, Michael P. Friedlander:
Variational Properties of Value Functions. 1689-1717 - Wei Bian, Xiaojun Chen
Worst-Case Complexity of Smoothing Quadratic Regularization Methods for Non-Lipschitzian Optimization. 1718-1741 - Jean B. Lasserre
A Lagrangian Relaxation View of Linear and Semidefinite Hierarchies. 1742-1756 - Orizon Pereira Ferreira
Convergence of the Gauss-Newton Method for Convex Composite Optimization under a Majorant Condition. 1757-1783 - Annabella Astorino
A Nonmonotone Proximal Bundle Method with (Potentially) Continuous Step Decisions. 1784-1809 - Boris S. Mordukhovich, R. Terry Rockafellar
Characterizations of Full Stability in Constrained Optimization. 1810-1849 - Hongbo Dong:
Symmetric Tensor Approximation Hierarchies for the Completely Positive Cone. 1850-1866 - Christoph Buchheim
An Exact Algorithm for Nonconvex Quadratic Integer Minimization Using Ellipsoidal Relaxations. 1867-1889 - Tomonari Kitahara, Takashi Tsuchiya:
A Simple Variant of the Mizuno-Todd-Ye Predictor-Corrector Algorithm and Its Objective-Function-Free Complexity. 1890-1903 - Marco Artina, Massimo Fornasier, Francesco Solombrino
Linearly Constrained Nonsmooth and Nonconvex Minimization. 1904-1937
Volume 23, Number 4, 2013
- Clóvis C. Gonzaga, Elizabeth W. Karas, Diane R. Rossetto:
An Optimal Algorithm for Constrained Differentiable Convex Optimization. 1939-1955 - Michele Monaci
On the Robust Knapsack Problem. 1956-1982 - Philip E. Gill, Daniel P. Robinson:
A Globally Convergent Stabilized SQP Method. 1983-2010 - Radu Ioan Bot, Ernö Robert Csetnek, André Heinrich:
A Primal-Dual Splitting Algorithm for Finding Zeros of Sums of Maximal Monotone Operators. 2011-2036 - Amir Beck, Luba Tetruashvili:
On the Convergence of Block Coordinate Descent Type Methods. 2037-2060 - Saeed Ghadimi, Guanghui Lan:
Optimal Stochastic Approximation Algorithms for Strongly Convex Stochastic Composite Optimization, II: Shrinking Procedures and Optimal Algorithms. 2061-2089 - Michael Hintermüller
Parabolic Quasi-variational Inequalities with Gradient-Type Constraints. 2090-2123 - Bamdev Mishra
Low-Rank Optimization with Trace Norm Penalty. 2124-2149 - William W. Hager, Hongchao Zhang:
The Limited Memory Conjugate Gradient Method. 2150-2168 - José Yunier Bello Cruz
A Subgradient Method for Vector Optimization Problems. 2169-2182 - Daniel Boley:
Local Linear Convergence of the Alternating Direction Method of Multipliers on Quadratic or Linear Programs. 2183-2207 - Chong Li, Xiaopeng Zhao, Yaohua Hu:
Quasi-Slater and Farkas-Minkowski Qualifications for Semi-infinite Programming with Applications. 2208-2230 - Yuri M. Ermoliev, Vladimir I. Norkin
Sample Average Approximation Method for Compound Stochastic Optimization Problems. 2231-2263 - Sheena Haines, Jason L. Loeppky, Paul Tseng, Xianfu Wang:
Convex Relaxations of the Weighted Maxmin Dispersion Problem. 2264-2294 - Lei Guo, Jane J. Ye
Mathematical Programs with Geometric Constraints in Banach Spaces: Enhanced Optimality, Exact Penalty, and Sensitivity. 2295-2319 - Naohiko Arima, Sunyoung Kim, Masakazu Kojima:
A Quadratically Constrained Quadratic Optimization Model for Completely Positive Cone Programming. 2320-2340 - Saeed Ghadimi, Guanghui Lan:
Stochastic First- and Zeroth-Order Methods for Nonconvex Stochastic Programming. 2341-2368 - Alexey F. Izmailov, Alexey S. Kurennoy
Abstract Newtonian Frameworks and Their Applications. 2369-2396 - Robert Hesse, D. Russell Luke:
Nonconvex Notions of Regularity and Convergence of Fundamental Algorithms for Feasibility Problems. 2397-2419 - Patrick L. Combettes
Systems of Structured Monotone Inclusions: Duality, Algorithms, and Applications. 2420-2447 - Zhaosong Lu
Sparse Approximation via Penalty Decomposition Methods. 2448-2478 - Georg Schildbach, Lorenzo Fagiano
Randomized Solutions to Convex Programs with Multiple Chance Constraints. 2479-2501 - Xuan Vinh Doan, Stephen A. Vavasis:
Finding Approximately Rank-One Submatrices with the Nuclear Norm and 퓁1-Norm. 2502-2540 - Radu Ioan Bot, Christopher Hendrich:
A Douglas-Rachford Type Primal-Dual Method for Solving Inclusions with Mixtures of Composite and Parallel-Sum Type Monotone Operators. 2541-2565
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-22 19:42 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: