Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSIAM Journal on Optimization, Volume 22
Volume 22, Number 1, 2012
- Georg Ch. Pflug
, Alois Pichler:
A Distance For Multistage Stochastic Optimization Models. 1-23 - Heinz H. Bauschke, Xianfu Wang, Calvin J. S. Wylie:
Fixed Points of Averages of Resolvents: Geometry and Algorithms. 24-40 - Xi Yin Zheng, Zhou Wei:
Perturbation Analysis of Error Bounds for Quasi-subsmooth Inequalities and Semi-infinite Constraint Systems. 41-65 - Coralia Cartis, Nicholas I. M. Gould, Philippe L. Toint:
On the Oracle Complexity of First-Order and Derivative-Free Algorithms for Smooth Nonconvex Minimization. 66-86 - Bilian Chen, Simai He, Zhening Li, Shuzhong Zhang:
Maximum Block Improvement and Polynomial Optimization. 87-107 - Amir Beck, Dror Pan:
On the Solution of the GPS Localization and Circle Fitting Problems. 108-134 - Pierre-Antoine Absil, Jérôme Malick:
Projection-like Retractions on Matrix Manifolds. 135-158 - Stephen J. Wright:
Accelerated Block-coordinate Relaxation for Regularized Optimization. 159-186 - Zoumana Coulibaly, Dominique Orban:
An 1 Elastic Interior-Point Method for Mathematical Programs with Complementarity Constraints. 187-211 - Giorgio Gnecco, Marcello Sanguineti, Mauro Gaggero:
Suboptimal Solutions to Team Optimization Problems with Stochastic Information Structure. 212-243 - Amir Beck, Aharon Ben-Tal, Luba Tetruashvili:
A Sequential Ascending Parameter Method for Solving Constrained Minimization Problems. 244-260 - Eduardo Casas, Fredi Tröltzsch:
Second Order Analysis for Optimal Control Problems: Improving Results Expected From Abstract Theory. 261-279
Volume 22, Number 2, 2012
- Mert Gürbüzbalaban, Michael L. Overton:
Some Regularity Results for the Pseudospectral Abscissa and Pseudospectral Radius of a Matrix. 281-285 - Vincent Guigues, Werner Römisch:
Sampling-Based Decomposition Methods for Multistage Stochastic Programs Based on Extended Polyhedral Risk Measures. 286-312 - Bingsheng He, Min Tao, Xiaoming Yuan:
Alternating Direction Method with Gaussian Back Substitution for Separable Convex Programming. 313-340 - Yurii E. Nesterov:
Efficiency of Coordinate Descent Methods on Huge-Scale Optimization Problems. 341-362 - Kristijan Cafuta, Igor Klep, Janez Povh:
Constrained Polynomial Optimization Problems with Noncommuting Variables. 363-383 - Damián R. Fernández, Mikhail V. Solodov:
Local Convergence of Exact and Inexact Augmented Lagrangian Methods under the Second-Order Sufficient Optimality Condition. 384-407 - Jiawang Nie, Li Wang:
Regularization Methods for SDP Relaxations in Large-Scale Polynomial Optimization. 408-428 - Necdet S. Aybat, Garud Iyengar:
A First-Order Augmented Lagrangian Method for Compressed Sensing. 429-459 - Mehdi Ghasemi, Murray Marshall:
Lower Bounds for Polynomials Using Geometric Programming. 460-473 - Frank E. Curtis, Michael L. Overton:
A Sequential Quadratic Programming Algorithm for Nonconvex, Nonsmooth Constrained Optimization. 474-500 - Jeffrey C. Lagarias, Bjorn Poonen, Margaret H. Wright:
Convergence of the Restricted Nelder-Mead Algorithm in Two Dimensions. 501-532 - Donald Goldfarb, Shiqian Ma:
Fast Multiple-Splitting Algorithms for Convex Optimization. 533-556 - Amir Beck, Marc Teboulle:
Smoothing and First Order Methods: A Unified Framework. 557-580 - Etienne de Klerk, Dmitrii V. Pasechnik:
Improved Lower Bounds for the 2-Page Crossing Numbers of Km, n and Kn via Semidefinite Programming. 581-595 - Wolfgang Ring, Benedikt Wirth:
Optimization Methods on Riemannian Manifolds and Their Application to Shape Space. 596-627 - Dimitra Bampou, Daniel Kuhn:
Polynomial Approximations for Continuous Linear Programs. 628-648 - Xiaojun Chen, Roger J.-B. Wets, Yanfang Zhang:
Stochastic Variational Inequalities: Residual Minimization Smoothing Sample Average Approximations. 649-673 - John C. Duchi, Peter L. Bartlett, Martin J. Wainwright:
Randomized Smoothing for Stochastic Optimization. 674-701 - Olivier Devolder, François Glineur, Yurii E. Nesterov:
Double Smoothing Technique for Large-Scale Linearly Constrained Convex Optimization. 702-727 - Negar Soheili, Javier Peña:
A Smooth Perceptron Algorithm. 728-737
Volume 22, Number 3, 2012
- Eldad Haber, Matthias Chung, Felix Herrmann:
An Effective Method for Parameter Estimation with PDE Constraints with Multiple Right-Hand Sides. 739-757 - Xi Yin Zheng, Zhou Wei:
Convergence of the Associated Sequence of Normal Cones of a Mosco Convergent Sequence of Sets. 758-771 - Roger Fletcher:
A Sequential Linear Constraint Programming Algorithm for NLP. 772-794 - Eduardo Casas, Roland Herzog, Gerd Wachsmuth:
Optimality Conditions and Error Analysis of Semilinear Elliptic Control Problems with L1 Cost Functional. 795-820 - Asen L. Dontchev:
Generalizations of the Dennis-Moré Theorem. 821-830 - Natashia L. Boland, Andrew C. Eberhard, Faramroze G. Engineer, Angelos Tsoukalas:
A New Approach to the Feasibility Pump in Mixed Integer Programming. 831-861 - Hideaki Iiduka:
Iterative Algorithm for Triple-Hierarchical Constrained Nonconvex Optimization Problem and Its Application to Network Bandwidth Allocation. 862-878 - Laurent Sorber, Marc Van Barel, Lieven De Lathauwer:
Unconstrained Optimization of Real Functions in Complex Variables. 879-898 - Marius Durea, Radu Strugariu:
Chain Rules for Linear Openness in General Banach Spaces. 899-913 - Renato D. C. Monteiro, Benar Fux Svaiter:
Iteration-Complexity of a Newton Proximal Extragradient Method for Monotone Variational Inequalities and Inclusion Problems. 914-935 - Gue Myung Lee, Nguyen Nang Tam, Nguyen Dong Yen:
Stability of Linear-Quadratic Minimization over Euclidean Balls. 936-952 - Boris S. Mordukhovich, R. Tyrrell Rockafellar:
Second-Order Subdifferential Calculus with Applications to Tilt Stability in Optimization. 953-986 - Guanglu Zhou, Louis Caccetta, Kok Lay Teo, Soon-Yi Wu:
Nonnegative Polynomial Optimization over Unit Spheres and Convex Programming Relaxations. 987-1008 - Takayuki Okuno, Shunsuke Hayashi, Masao Fukushima:
A Regularized Explicit Exchange Method for Semi-Infinite Programs with an Infinite Number of Conic Constraints. 1009-1028 - Dennis Amelunxen, Peter Bürgisser:
A Coordinate-Free Condition Number for Convex Programming. 1029-1041 - Kaifeng Jiang, Defeng Sun, Kim-Chuan Toh:
An Inexact Accelerated Proximal Gradient Method for Large Scale Linearly Constrained Convex SDP. 1042-1064 - Yun-Bin Zhao, Duan Li:
Reweighted 1-Minimization for Sparse Solutions to Underdetermined Linear Systems. 1065-1088 - Emmanuel N. Barron, Rafal Goebel, Robert R. Jensen:
Functions Which Are Quasiconvex under Linear Perturbations. 1089-1108 - Roberto Andreani, Gabriel Haeser, María Laura Schuverdt, Paulo J. S. Silva:
Two New Weak Constraint Qualifications and Applications. 1109-1135 - Diego A. Morán R., Santanu S. Dey, Juan Pablo Vielma:
A Strong Dual for Conic Mixed-Integer Programs. 1136-1150 - Lei Guo, Gui-Hua Lin, Jane J. Ye:
Stability Analysis for Parametric Mathematical Programs with Geometric Constraints and Its Applications. 1151-1176
Volume 22, Number 4, 2012
- Aswin Kannan, Uday V. Shanbhag:
Distributed Computation of Equilibria in Monotone Nash Games via Iterative Regularization Techniques. 1177-1205 - Frank Schöpfer:
Exact Regularization of Polyhedral Norms. 1206-1223 - Michael Hintermüller, Carlos N. Rautenberg:
A Sequential Minimization Technique for Elliptic Quasi-variational Inequalities with Gradient Constraints. 1224-1257 - Dinh Quoc Tran, Carlo Savorgnan, Moritz Diehl:
Adjoint-Based Predictor-Corrector Sequential Convex Programming for Parametric Nonlinear Optimization. 1258-1284 - Paul T. Boggs, David M. Gay, Stewart K. Griffiths, Robert Michael Lewis, Kevin R. Long, Stephen G. Nash, Robert H. Nilson:
Optimization Algorithms for Hierarchical Problems with Application to Nanoporous Materials. 1285-1308 - Stephan Dempe, Boris S. Mordukhovich, Alain B. Zemkoho:
Sensitivity Analysis for Two-Level Value Functions with Applications to Bilevel Programming. 1309-1343 - Ilya O. Ryzhov, Warren B. Powell:
Information Collection for Linear Programs with Uncertain Objective Coefficients. 1344-1368 - Amir Shahzad, Eric C. Kerrigan, George A. Constantinides:
A Stable and Efficient Method for Solving a Convex Quadratic Program with Application to Optimal Control. 1369-1393 - Sin-Shuen Cheung, Anthony Man-Cho So, Kuncheng Wang:
Linear Matrix Inequalities with Stochastically Dependent Perturbations and Applications to Chance-Constrained Semidefinite Optimization. 1394-1430 - Min Tao, Xiaoming Yuan:
On the O(1/t) Convergence Rate of Alternating Direction Method with Logarithmic-Quadratic Proximal Regularization. 1431-1448 - Carlos Diego Rodrigues, Dominique Quadri, Philippe Michelon, Serigne Gueye:
0-1 Quadratic Knapsack Problems: An Exact Approach Based on a t-Linearization. 1449-1468 - Saeed Ghadimi, Guanghui Lan:
Optimal Stochastic Approximation Algorithms for Strongly Convex Stochastic Composite Optimization I: A Generic Algorithmic Framework. 1469-1492 - Carlos Eduardo Ferreira, Ute Günther, Alexander Martin:
Mathematical Models and Polyhedral Studies for Integral Sheet Metal Design. 1493-1517 - Güzin Bayraksan, Péguy Pierre-Louis:
Fixed-Width Sequential Stopping Rules for a Class of Stochastic Programs. 1518-1548 - John C. Duchi, Alekh Agarwal, Mikael Johansson, Michael I. Jordan:
Ergodic Mirror Descent. 1549-1578 - Alexey F. Izmailov, Mikhail V. Solodov, E. I. Uskov:
Global Convergence of Augmented Lagrangian Methods Applied to Optimization Problems with Degenerate Constraints, Including Problems with Complementarity Constraints. 1579-1606 - Ellen H. Fukuda, Paulo J. S. Silva, Masao Fukushima:
Differentiable Exact Penalty Functions for Nonlinear Second-Order Cone Programs. 1607-1633 - Florian A. Potra:
Weighted Complementarity Problems - A New Paradigm for Computing Equilibria. 1634-1654 - Guoyin Li, Boris S. Mordukhovich:
Hölder Metric Subregularity with Applications to Proximal Point Method. 1655-1684
a service of 
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-04-25 21:50 CEST 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:
