default search action
SIAM Journal on Optimization, Volume 19
Volume 19, Number 1, 2008
- Huynh van Ngai, Michel Théra
:
Error Bounds in Metric Spaces and Application to the Perturbation Stability of Metric Regularity. 1-20 - Marc E. Pfetsch
Branch-and-Cut for the Maximum Feasible Subsystem Problem. 21-38 - Fanwen Meng, Gongyun Zhao, Mark Goh
Lagrangian-Dual Functions and Moreau--Yosida Regularization. 39-61 - Xi Yin Zheng, Kung Fu Ng:
Linear Regularity for a Collection of Subsmooth Sets in Banach Spaces. 62-76 - Alexander Mitsos
Relaxation-Based Bounds for Semi-Infinite Programs. 77-113 - Florian A. Potra:
Primal-Dual Affine Scaling Interior Point Methods for Linear Complementarity Problems. 114-143 - Jing-Hui Qiu:
Dual Characterization and Scalarization for Benson Proper Efficiency. 144-162 - Chong Li, Kung Fu Ng, Ting Kei Pong
Constraint Qualifications for Convex Inequality Systems with Applications in Constrained Optimization. 163-187 - Charles Audet
Multiobjective Optimization Through a Series of Single-Objective Formulations. 188-210 - Francesca Faraci, Antonio Iannizzotto
Well Posed Optimization Problems and Nonconvex Chebyshev Sets in Hilbert Spaces. 211-216 - Radu Ioan Bot, Ernö Robert Csetnek, Gert Wanka:
Regularity Conditions via Quasi-Relative Interior in Convex Programming. 217-233 - David Bartl
A Short Algebraic Proof of the Farkas Lemma. 234-239 - Lisandro A. Parente, Pablo A. Lotito, Mikhail V. Solodov:
A Class of Inexact Variable Metric Proximal Point Algorithms. 240-260 - Dennis Cheung, Felipe Cucker
A Condition Number for Multifold Conic Systems. 261-280 - Pierre Apkarian, Dominikus Noll, O. Prot:
A Trust Region Spectral Bundle Method for Nonconvex Eigenvalue Optimization. 281-306 - Andrea Walther
A First-Order Convergence Analysis of Trust-Region Methods with Inexact Jacobians. 307-325 - Matthias Gerdts
Global Convergence of a Nonsmooth Newton Method for Control-State Constrained Optimal Control Problems. 326-350 - Richard H. Byrd, Frank E. Curtis
An Inexact SQP Method for Equality Constrained Optimization. 351-369 - Zi Xian Chan, Defeng Sun
Constraint Nondegeneracy, Strong Regularity, and Nonsingularity in Semidefinite Programming. 370-396 - Paul-Emile Maingé, Abdellatif Moudafi:
Convergence of New Inertial Proximal Methods for DC Programming. 397-413 - Serge Gratton, Annick Sartenaer, Philippe L. Toint
Recursive Trust-Region Methods for Multiscale Nonlinear Optimization. 414-444 - Jing Hu, John E. Mitchell, Jong-Shi Pang, Kristin P. Bennett, Gautam Kunapuli
On the Global Solution of Linear Programs with Linear Complementarity Constraints. 445-471 - Frank Göring
Embedded in the Shadow of the Separator. 472-501
Volume 19, Number 2, 2008
- Simai He
Semidefinite Relaxation Bounds for Indefinite Homogeneous Quadratic Optimization. 503-523 - Tito Homem-de-Mello
On Rates of Convergence for Stochastic Optimization Problems Under Non--Independent and Identically Distributed Sampling. 524-551 - Ralf Gollmer, Frederike Neise, Rüdiger Schultz:
Stochastic Programs with First-Order Dominance Constraints Induced by Mixed-Integer Linear Recourse. 552-571 - Nebojsa Gvozdenovic, Monique Laurent:
The Operator Psi for the Chromatic Number of a Graph. 572-591 - Nebojsa Gvozdenovic, Monique Laurent:
Computing Semidefinite Programming Lower Bounds for the (Fractional) Chromatic Number Via Block-Diagonalization. 592-615 - Eduardo Casas
Sufficient Second-Order Optimality Conditions for Semilinear Control Problems with Pointwise State Constraints. 616-643 - Harald Günzel, Hubertus Th. Jongen, Jan-J. Rückmann:
On Stable Feasible Sets in Generalized Semi-infinite Programming. 644-654 - Zizhuo Wang
Further Relaxations of the Semidefinite Programming Approach to Sensor Network Localization. 655-673 - James R. Luedtke, Shabbir Ahmed
A Sample Approximation Approach for Optimization with Probabilistic Constraints. 674-699 - Dinh The Luc, Roger J.-B. Wets:
Outer Semicontinuity of Positive Hull Mappings with Application to Semi-Infinite and Stochastic Programming. 700-713 - D. Russell Luke:
Finding Best Approximation Pairs Relative to a Convex and Prox-Regular Set in a Hilbert Space. 714-739 - Louis A. Romero, Jeff Mason:
Pitchfork Bifurcations in Nonlinear Least Squares Problems--Applications to TOA Geolocation. 740-755 - Kristin Winkler:
A Characterization of Efficient and Weakly Efficient Points in Convex Vector Optimization. 756-765 - Heinz H. Bauschke
The Proximal Average: Basic Theory. 766-785 - Dan Butnariu, Yair Censor
On The Behavior of Subgradient Projections Methods for Convex Feasibility Problems in Euclidean Spaces. 786-807 - Florian Jarre, Franz Rendl:
An Augmented Primal-Dual Method for Linear Conic Programs. 808-823 - Fumiaki Kohsaka, Wataru Takahashi:
Existence and Approximation of Fixed Points of Firmly Nonexpansive-Type Mappings in Banach Spaces. 824-835 - Frank Heyde, Andreas Löhne:
Geometric Duality in Multiple Objective Linear Programming. 836-845 - Radek Kucera
Convergence Rate of an Optimization Algorithm for Minimizing Quadratic Functions with Separable Convex Constraints. 846-862 - Abderrahim Hantoute, Marco A. López
Subdifferential Calculus Rules in Convex Analysis: A Unifying Approach Via Pointwise Supremum Functions. 863-882 - Shaohua Pan, Jein-Shan Chen
A Class of Interior Proximal-Like Algorithms for Convex Second-Order Cone Programming. 883-910 - Hariharan Lakshmanan, Daniela Pucci de Farias:
Decentralized Resource Allocation in Dynamic Networks of Agents. 911-940 - Hà Huy Vui, Pham Tien So'n:
Global Optimization of Polynomials Using the Truncated Tangency Variety and Sums of Squares. 941-951 - Christian Küchler:
On Stability of Multistage Stochastic Programs. 952-968 - Bogdan I. Gavrea, Mihai Anitescu
Convergence of a Class of Semi-Implicit Time-Stepping Schemes for Nonsmooth Rigid Multibody Dynamics. 969-1001
Volume 19, Number 3, 2008
- Alexey F. Izmailov, Mikhail V. Solodov:
An Active-Set Newton Method for Mathematical Programs with Complementarity Constraints. 1003-1027 - Lingchen Kong, Jie Sun
A Regularized Smoothing Newton Method for Symmetric Cone Complementarity Problems. 1028-1047 - Adrian S. Lewis, Chin How Jeffrey Pang:
Variational Analysis of Pseudospectra. 1048-1072 - Alexandre Belloni, Robert M. Freund:
On the Second-Order Feasibility Cone: Primal-Dual Representation and Efficient Projection. 1073-1092 - Andrzej Cegielski
Relaxed Alternating Projection Methods. 1093-1106 - Elaine T. Hale
Fixed-Point Continuation for l1-Minimization: Methodology and Convergence. 1107-1130 - David Hartvigsen, Yanjun Li:
Polyhedral Results for 1-Restricted Simple 2-Matchings. 1131-1149 - Charles Audet, John E. Dennis Jr., Sébastien Le Digabel
Parallel Space Decomposition of the Mesh Adaptive Direct Search Algorithm. 1150-1170 - Alexandre d'Aspremont:
Smooth Optimization with Approximate Gradient. 1171-1183 - Jacek Gondzio
A New Unblocking Technique to Warmstart Interior Point Methods Based on Sensitivity Analysis. 1184-1210 - Marco C. Campi, Simone Garatti
The Exact Feasibility of Randomized Solutions of Uncertain Convex Programs. 1211-1230 - Ademir A. Ribeiro, Elizabeth W. Karas, Clóvis C. Gonzaga:
Global Convergence of Filter Methods for Nonlinear Programming. 1231-1249 - Marc Quincampoix
Parameterized Minimax Problem: On Lipschitz-Like Dependence of the Solution with Respect to the Parameter. 1250-1269 - Leah Epstein, Asaf Levin
On Bin Packing with Conflicts. 1270-1298 - Roberto H. Bielschowsky, Francisco A. M. Gomes
Dynamic Control of Infeasibility in Equality Constrained Optimization. 1299-1325 - Gábor Rudolf, Andrzej Ruszczynski:
Optimization Problems with Second Order Stochastic Dominance Constraints: Duality, Compact Formulations, and Cut Generation Methods. 1326-1343 - Seung-Jean Kim, Stephen P. Boyd:
A Minimax Theorem with Applications to Machine Learning, Signal Processing, and Finance. 1344-1367 - E. Alper Yildirim
Two Algorithms for the Minimum Enclosing Ball Problem. 1368-1391 - Selin Damla Ahipasaoglu
Identification and Elimination of Interior Points for the Minimum Enclosing Ball Problem. 1392-1396 - Amir Beck, Marc Teboulle, Zahar Chikishev:
Iterative Minimization Schemes for Solving the Single Source Localization Problem. 1397-1416 - Anton Schiela:
A Simplified Approach to Semismooth Newton Methods in Function Space. 1417-1432 - James R. Luedtke:
New Formulations for Optimization under Stochastic Dominance Constraints. 1433-1450 - Matthias Jach, Dennis Michaels, Robert Weismantel:
The Convex Envelope of (n--1)-Convex Functions. 1451-1466 - Silvia Vogel:
Universal Confidence Sets for Solutions of Optimization Problems. 1467-1488 - Guoyin Li
On Extension of Fenchel Duality and its Application. 1489-1509
Volume 19, Number 4, 2008
- Maria B. Chiarolla, Ulrich G. Haussmann:
Multivariable Utility Functions. 1511-1533 - Jiawang Nie, James Demmel:
Sparse SOS Relaxations for Minimizing Functions that are Summations of Small Polynomials. 1534-1558 - Etienne de Klerk, Dmitrii V. Pasechnik
On Semidefinite Programming Relaxations of the Traveling Salesman Problem. 1559-1573
Volume 19, Number 4, 2009
- Arkadi Nemirovski
Robust Stochastic Approximation Approach to Stochastic Programming. 1574-1609 - Sergio Conti, Harald Held, Martin Pach, Martin Rumpf
Shape Optimization Under Uncertainty---A Stochastic Programming Perspective. 1610-1632 - W. H. Yang:
Error Bounds for Convex Polynomials. 1633-1647 - Xi Yin Zheng, Kung Fu Ng:
Calmness for L-Subsmooth Multifunctions in Banach Spaces. 1648-1673 - Jorge Nocedal, Andreas Wächter, Richard A. Waltz:
Adaptive Barrier Update Strategies for Nonlinear Interior Methods. 1674-1693 - Gabriele Eichfelder
An Adaptive Scalarization Method in Multiobjective Optimization. 1694-1718 - Pierre Carpentier, Jean-Philippe Chancelier
Approximations of Stochastic Optimization Problems Subject to Measurability Constraints. 1719-1734 - Wenbao Ai, Shuzhong Zhang:
Strong Duality for the CDT Subproblem: A Necessary and Sufficient Condition. 1735-1756 - Angelia Nedic
Approximate Primal Solutions and Rate Analysis for Dual Subgradient Methods. 1757-1780 - Gergely Mádi-Nagy:
On Multivariate Discrete Moment Problems: Generalization of the Bivariate Min Algorithm for Higher Dimensions. 1781-1806 - Zhaosong Lu
Smooth Optimization Approach for Sparse Covariance Selection. 1807-1827 - Nicolai Bissantz, Lutz Dümbgen
Convergence Analysis of Generalized Iteratively Reweighted Least Squares Algorithms on Convex Function Spaces. 1828-1845 - Sanjay Mehrotra, M. Gökhan Özevin:
On the Implementation of Interior Point Decomposition Algorithms for Two-Stage Stochastic Conic Programs. 1846-1880 - Hideaki Iiduka
A Use of Conjugate Gradient Direction for the Convex Optimization Problem over the Fixed Point Set of a Nonexpansive Mapping. 1881-1893 - Alexander D. Ioffe:
An Invitation to Tame Optimization. 1894-1917 - Guanghui Lan, Renato D. C. Monteiro, Takashi Tsuchiya:
A Polynomial Predictor-Corrector Trust-Region Algorithm for Linear Programming. 1918-1946 - Achiya Dax:
A New Class of Minimum Norm Duality Theorems. 1947-1969 - Mounir El Maghri, Mohamed Laghdir:
Pareto Subdifferential Calculus for Convex Vector Mappings and Applications to Vector Optimization. 1970-1994 - Jean B. Lasserre
Convexity in SemiAlgebraic Geometry and Polynomial Optimization. 1995-2014
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: