default search action
SIAM Journal on Optimization, Volume 20
Volume 20, Number 1, 2009
- Giampaolo Liuzzi
, Stefano Lucidi
A Derivative-Free Algorithm for Inequality Constrained Nonlinear Programming via Smoothing of an linfty Penalty Function. 1-29 - Stefan Bundfuss, Mirjam Dür:
An Adaptive Linear Approximation Algorithm for Copositive Programs. 30-53 - Ranga Muhandiramge, Natashia Boland
Convergent Network Approximation for the Continuous Euclidean Length Constrained Minimum Cost Path Problem. 54-77 - Abdeslam Kadrani, Jean-Pierre Dussault, Abdelhamid Benchakroun:
A New Regularization Scheme for Mathematical Programs with Complementarity Constraints. 78-103 - Audrey Hermant:
Stability Analysis of Optimal Control Problems with a Second-Order State Constraint. 104-129 - Michael Stingl
A Sequential Convex Semidefinite Programming Algorithm with an Application to Multiple-Load Free Material Optimization. 130-155 - Joris Vanbiervliet, Bart Vandereycken
The Smoothed Spectral Abscissa for Robust Stability Optimization. 156-171 - Jorge J. Moré, Stefan M. Wild
Benchmarking Derivative-Free Optimization Algorithms. 172-191 - Sunyoung Kim, Masakazu Kojima, Hayato Waki
Exploiting Sparsity in SDP Relaxation for Sensor Network Localization. 192-215 - Yves Lucet:
What Shape Is Your Conjugate? A Survey of Computational Convex Analysis and Its Applications. 216-250 - Andrew C. Eberhard
Some Sufficient Optimality Conditions in Nonsmooth Analysis. 251-296 - Christian Kanzow, Izabella Ferenczi, Masao Fukushima:
On the Local Convergence of Semismooth Newton Methods for Linear and Nonlinear Second-Order Cone Programs Without Strict Complementarity. 297-320 - C. Bogani, Maria Grazia Gasparo, Alessandra Papini:
Generating Set Search Methods for Piecewise Smooth Problems. 321-335 - Jérôme Malick, Janez Povh
Regularization Methods for Semidefinite Programming. 336-356 - Giacomo d'Antonio, Antonio Frangioni
Convergence Analysis of Deflected Conditional Approximate Subgradient Methods. 357-386 - Andrew R. Conn, Katya Scheinberg
Global Convergence of General Derivative-Free Trust-Region Algorithms to First- and Second-Order Critical Points. 387-415 - Petr Beremlijski
Shape Optimization in Three-Dimensional Contact Problems with Coulomb Friction. 416-444 - Charles Audet, John E. Dennis Jr.:
A Progressive Barrier for Derivative-Free Nonlinear Programming. 445-472 - Hubertus Th. Jongen, Jan-J. Rückmann, Vladimir Shikhman:
MPCC: Critical Point Theory. 473-484 - Jiawang Nie, Kristian Ranestad:
Algebraic Degree of Polynomial Optimization. 485-502 - Chek Beng Chua
A T-Algebraic Approach to Primal-Dual Interior-Point Algorithms. 503-523 - Michael Stingl
Free Material Optimization with Fundamental Eigenfrequency Constraints. 524-547 - Simon P. Schurr, Dianne P. O'Leary
A Polynomial-Time Interior-Point Method for Conic Optimization, With Inexact Barrier Evaluations. 548-571
Volume 20, Number 2, 2009
- Alexander Mitsos
McCormick-Based Relaxations of Algorithms. 573-601 - Jörg Fliege
Newton's Method for Multiobjective Optimization. 602-626 - Chao Zhang, Xiaojun Chen
Smoothing Projected Gradient Method and Its Application to Stochastic Linear Complementarity Problems. 627-649 - Warren L. Hare:
A Proximal Average for Nonconvex Functions: A Proximal Stability Perspective. 650-666 - Guoyin Li
Error Bounds of Generalized D-Gap Functions for Nonsmooth and Nonmonotone Variational Inequality Problems. 667-690 - S. Sundhar Ram, Angelia Nedic
Incremental Stochastic Subgradient Algorithms for Convex Optimization. 691-717 - Stephan Dempe
On Reducibility in Bilevel Problems. 718-727 - Jean-Bernard Baillon, Roberto Cominetti
Asymptotic Expansion of Penalty-Gradient Flows in Linear Programming. 728-739 - William W. Hager, Dzung T. Phan:
An Ellipsoidal Branch and Bound Algorithm for Global Optimization. 740-758 - J. William Helton, Jiawang Nie:
Sufficient and Necessary Conditions for Semidefinite Representability of Convex Hulls and Sets. 759-791 - Stephen P. Boyd, Persi Diaconis, Pablo A. Parrilo
Fastest Mixing Markov Chain on Graphs with Symmetries. 792-819 - Aris Daniilidis
Identifying Structure of Nonsmooth Convex Functions by the Bundle Technique. 820-840 - Refail Kasimbeyli, Musa Mammadov
On Weak Subdifferentials, Directional Derivatives, and Radial Epiderivatives for Nonconvex Functions. 841-855 - Satoru Fujishige
Minimizing Continuous Extensions of Discrete Convex Functions with Linear Inequality Constraints. 856-867 - Michael Hintermüller
Mathematical Programs with Complementarity Constraints in Function Space: C- and Strong Stationarity and a Path-Following Algorithm. 868-902 - Uriel G. Rothblum:
Efficient Solution of a Stochastic Scheduling Problem on an Out-Forest---Revisited. 903-914 - Daniel Mueller-Gritschneder
A Successive Approach to Compute the Bounded Pareto Front of Practical Multiobjective Optimization Problems. 915-934 - Pierre Maréchal, Jane J. Ye
Optimizing Condition Numbers. 935-947 - Mark A. Abramson, Charles Audet, John E. Dennis Jr., Sébastien Le Digabel
OrthoMADS: A Deterministic MADS Instance with Orthogonal Directions. 948-966 - Kent Andersen, Christian Wagner, Robert Weismantel:
On an Analysis of the Strength of Mixed-Integer Cutting Planes from Multiple Simplex Tableau Rows. 967-982 - Vaithilingam Jeyakumar
Alternative Theorems for Quadratic Inequality Systems and Global Quadratic Optimization. 983-1001 - Anton Schiela:
Barrier Methods for Optimal Control Problems with State Constraints. 1002-1031 - Chong Li, Donghui Fang, Genaro López-Acedo
Stable and Total Fenchel Duality for Convex Optimization Problems in Locally Convex Spaces. 1032-1051 - Oliver Stein, Aysun Tezel:
The Semismooth Approach for Semi-Infinite Programming without Strict Complementarity. 1052-1072 - Samuel Burer, Adam N. Letchford
On Nonconvex Quadratic Programming with Box Constraints. 1073-1089 - Sanjeeb Dash, Oktay Günlük
On Mixing Inequalities: Rank, Closure, and Cutting-Plane Proofs. 1090-1109 - Jennifer B. Erway, Philip E. Gill, Joshua D. Griffin:
Iterative Methods for Finding a Trust-region Step. 1110-1131 - Etienne de Klerk, Dmitrii V. Pasechnik, Renata Sotirov:
Erratum: On Semidefinite Programming Relaxations of the Traveling Salesman Problem. 1132
Volume 20, Number 3, 2009
- Michael Hintermüller
PDE-Constrained Optimization Subject to Pointwise Constraints on the Control, the State, and Its Derivative. 1133-1156 - Björn Johansson, Maben Rabi
A Randomized Incremental Subgradient Method for Distributed Optimization in Networked Systems. 1157-1170 - Hubertus Th. Jongen, Jan-J. Rückmann, Vladimir Shikhman:
On Stability of the Feasible Set of a Mathematical Problem with Complementarity Problems. 1171-1184 - Arun Padakandla, Rajesh Sundaresan:
Separable Convex Optimization Problems with Linear Ascending Constraints. 1185-1204 - Vladimir I. Norkin
On Convergence of Kernel Learning Estimators. 1205-1223 - Frank E. Curtis
A Matrix-Free Algorithm for Equality Constrained Optimization Problems with Rank-Deficient Jacobians. 1224-1249 - Tito Homem-de-Mello
A Cutting-Surface Method for Uncertain Linear Programs with Polyhedral Stochastic Dominance Constraints. 1250-1273 - Didier Aussel, Yboon García, Nicolas Hadjisavvas
Single-Directional Property of Multivalued Maps and Variational Systems. 1274-1285 - Chen Ling, Jiawang Nie, Liqun Qi
Biquadratic Optimization Over Unit Spheres and Semidefinite Programming Relaxations. 1286-1310 - D. H. Fang, C. Li, Kung Fu Ng:
Constraint Qualifications for Extended Farkas's Lemmas and Lagrangian Dualities in Convex Infinite Programming. 1311-1332 - Florian A. Potra, Josef Stoer:
On a Class of Superlinearly Convergent Polynomial Time Interior Point Methods for Sufficient LCP. 1333-1363 - Stephen A. Vavasis:
On the Complexity of Nonnegative Matrix Factorization. 1364-1377 - Robert Michael Lewis, Virginia Torczon:
Active Set Identification for Linearly Constrained Minimization Without Explicit Derivatives. 1378-1405 - Georg Ch. Pflug
Version-Independence and Nested Distributions in Multistage Stochastic Optimization. 1406-1420 - Filiz Gürtuna:
Duality of Ellipsoidal Approximations via Semi-Infinite Programming. 1421-1438 - Jennifer B. Erway, Philip E. Gill:
A Subspace Minimization Method for the Trust-Region Step. 1439-1461 - Thai Doan Chuong
Subdifferentials of Marginal Functions in Semi-infinite Programming. 1462-1477 - Zaiwen Wen, Donald Goldfarb:
A Line Search Multigrid Method for Large-Scale Nonlinear Optimization. 1478-1503 - María J. Cánovas, Marco A. López, Boris S. Mordukhovich, Juan Parra:
Variational Analysis in Semi-Infinite and Infinite Programming, I: Stability of Linear Inequality Systems of Feasible Solutions. 1504-1526 - Shunsuke Hayashi, Soon-Yi Wu:
An Explicit Exchange Algorithm For Linear Semi-Infinite Programming Problems With Second-Order Cone Constraints. 1527-1546 - Elias Salomão Helou Neto
Incremental Subgradients for Constrained Convex Optimization: A Unified Framework and New Methods. 1547-1572
Volume 20, Number 3, 2010
- Toshizumi Fukui, Krzysztof Kurdyka, Laurentiu Paunescu
Tame Nonsmooth Inverse Mapping Theorems. 1573-1590 - Refail Kasimbeyli:
A Nonlinear Cone Separation Theorem and Scalarization in Nonconvex Vector Optimization. 1591-1619 - Somayeh Moazeni, Thomas F. Coleman, Yuying Li:
Optimal Portfolio Execution Strategies and Sensitivity to Price Impact Parameters. 1620-1654 - Jan Albersmeyer, Moritz Diehl:
The Lifted Newton Method and Its Application in Optimization. 1655-1684
Volume 20, Number 4, 2010
- Huifu Xu
Necessary Optimality Conditions for Two-Stage Stochastic Programs with Equilibrium Constraints. 1685-1715 - Zhi-Quan Luo, Shuzhong Zhang:
A Semidefinite Relaxation Scheme for Multivariate Quartic Polynomial Optimization with Quadratic Constraints. 1716-1736 - Xin-Yuan Zhao, Defeng Sun
A Newton-CG Augmented Lagrangian Method for Semidefinite Programming. 1737-1765 - Rafael Correa, Pedro Gajardo
Various Lipschitz-like Properties for Functions and Sets I: Directional Derivative and Tangential Characterizations. 1766-1785 - Ali Pinar, Juan C. Meza
Optimization Strategies for the Vulnerability Analysis of the Electric Power Grid. 1786-1810 - Guanglu Zhou, Louis Caccetta, Kok Lay Teo:
A Superlinearly Convergent Method for a Class of Complementarity Problems with Non-Lipschitzian Functions. 1811-1827 - Alexander Engau
On Interior-Point Warmstarts for Linear and Combinatorial Optimization. 1828-1861 - Guoyong Gu, Cornelis Roos:
Counterexample to a Conjecture on an Infeasible Interior-Point Method. 1862-1867 - Alfred Auslender:
Computing Points that Satisfy Second Order Necessary Optimality Conditions for Unconstrained Minimization. 1868-1884 - Jane J. Ye
New Necessary Optimality Conditions for Bilevel Programs by Combining the MPEC and Value Function Approaches. 1885-1905 - Mikalai Kisialiou, Zhi-Quan Luo:
Probabilistic Analysis of Semidefinite Relaxation for Binary Quadratic Minimization. 1906-1922 - Guoyin Li
On the Asymptotically Well Behaved Functions and Global Error Bound for Convex Polynomials. 1923-1943 - Tim Netzer
Exposed Faces of Semidefinitely Representable Sets. 1944-1955 - Jian-Feng Cai
A Singular Value Thresholding Algorithm for Matrix Completion. 1956-1982 - Krzysztof C. Kiwiel:
A Nonderivative Version of the Gradient Sampling Algorithm for Nonsmooth Nonconvex Optimization. 1983-1994 - Jean B. Lasserre
A "Joint+Marginal" Approach to Parametric Polynomial Optimization. 1995-2022 - Nicholas I. M. Gould
A Second Derivative SQP Method: Global Convergence. 2023-2048 - Nicholas I. M. Gould
A Second Derivative SQP Method: Local Convergence and Practical Issues. 2049-2079 - Huynh van Ngai, Alexander Kruger
Stability of Error Bounds for Semi-infinite Convex Constraint Systems. 2080-2096 - João Gouveia
Theta Bodies for Polynomial Ideals. 2097-2118
Volume 20, Number 5, 2010
- Xi Yin Zheng, Kung Fu Ng:
Metric Subregularity and Calmness for Nonconvex Generalized Equations in Banach Spaces. 2119-2136 - Hubertus Th. Jongen, Jan-J. Rückmann:
On Interior Logarithmic Smoothing and Strongly Stable Stationary Points. 2137-2156 - Stefano Pironio, Miguel Navascués
Convergent Relaxations of Polynomial Optimization Problems with Noncommuting Variables. 2157-2180 - Ashutosh Mahajan, Ted K. Ralphs:
On the Complexity of Selecting Disjunctions in Integer Programming. 2181-2198 - René Henrion, Boris S. Mordukhovich, Nguyen Mau Nam:
Second-Order Analysis of Polyhedral Systems in Finite and Infinite Dimensions with Applications to Robust Stability of Variational Inequalities. 2199-2227 - Francisco Facchinei
Penalty Methods for the Solution of Generalized Nash Equilibrium Problems. 2228-2253 - Nguyen Dinh, Miguel A. Goberna
On the Stability of the Feasible Set in Optimization Problems. 2254-2280 - Richard H. Byrd, Frank E. Curtis
Infeasibility Detection and SQP Methods for Nonlinear Optimization. 2281-2299 - Lionel Thibault, Dariusz Zagrodny
Subdifferential Determination of Essentially Directionally Smooth Functions in Banach Space. 2300-2326 - Michel Journée, Francis R. Bach, Pierre-Antoine Absil, Rodolphe Sepulchre:
Low-Rank Optimization on the Cone of Positive Semidefinite Matrices. 2327-2351 - Daniel Bienstock, Abhinav Verma:
The N-k Problem in Power Grids: New Models, Formulations, and Numerical Experiments. 2352-2380 - Stephan Bütikofer, Diethard Klatte:
A Nonsmooth Newton Method with Path Search and Its Use in Solving C1, 1 Programs and Semi-Infinite Problems. 2381-2412 - Alexander J. Zaslavski:
Convergence of a Proximal Point Method in the Presence of Computational Errors in Hilbert Spaces. 2413-2421 - Weijun Zhou, Xiaojun Chen
Global Convergence of a New Hybrid Gauss--Newton Structured BFGS Method for Nonlinear Least Squares Problems. 2422-2441 - Warren L. Hare, Claudia A. Sagastizábal
A Redistributed Proximal Bundle Method for Nonconvex Optimization. 2442-2473 - Sanjay Mehrotra, M. Gökhan Özevin:
Convergence of a Weighted Barrier Decomposition Algorithm for Two-Stage Stochastic Programming with Discrete Support. 2474-2486 - Francisco Guerra Vázquez, Hubertus Th. Jongen, Vladimir Shikhman:
General Semi-Infinite Programming: Symmetric Mangasarian-Fromovitz Constraint Qualification and the Closure of the Feasible Set. 2487-2503 - Sonja Steffensen, Michael Ulbrich
A New Relaxation Scheme for Mathematical Programs with Equilibrium Constraints. 2504-2539 - Nguyen Dinh, Marco A. López
Functional Inequalities in the Absence of Convexity and Lower Semicontinuity with Applications to Optimization. 2540-2559 - Chek Beng Chua
A Continuation Method for Nonlinear Complementarity Problems over Symmetric Cones. 2560-2583 - Alexey F. Izmailov, Mikhail V. Solodov:
A Truncated SQP Method Based on Inexact Interior-Point Solutions of Subproblems. 2584-2613 - Giampaolo Liuzzi
Sequential Penalty Derivative-Free Methods for Nonlinear Constrained Optimization. 2614-2635 - Heinz H. Bauschke
On Borwein--Wiersma Decompositions of Monotone Linear Relations. 2636-2652 - Regina Sandra Burachik
Inexact Proximal Point Methods for Variational Inequality Problems. 2653-2678 - Nathan Krislock, Henry Wolkowicz:
Explicit Sensor Network Localization using Semidefinite Representations and Facial Reductions. 2679-2708 - Hoang Xuan Phu:
Minimizing Convex Functions with Bounded Perturbations. 2709-2729 - Christian Kanzow, Alexandra Schwartz
Mathematical Programs with Equilibrium Constraints: Enhanced Fritz John-conditions, New Constraint Qualifications, and Improved Exact Penalty Results. 2730-2753
Volume 20, Number 6, 2010
- Renato D. C. Monteiro, Benar Fux Svaiter
On the Complexity of the Hybrid Proximal Extragradient Method for the Iterates and the Ergodic Mean. 2755-2787 - María J. Cánovas
Variational Analysis in Semi-Infinite and Infinite Programming, II: Necessary Optimality Conditions. 2788-2806 - Shai Shalev-Shwartz, Nathan Srebro, Tong Zhang:
Trading Accuracy for Sparsity in Optimization Problems with Sparsity Constraints. 2807-2832 - Coralia Cartis, Nicholas I. M. Gould
On the Complexity of Steepest Descent, Newton's and Regularized Newton's Methods for Nonconvex Unconstrained Optimization Problems. 2833-2852 - Yang Li
A New Class of Large Neighborhood Path-Following Interior Point Algorithms for Semidefinite Optimization with O(√n log (Tr(X0S0)/ε)) Iteration Complexity. 2853-2875 - Mohab Safey El Din, Lihong Zhi:
Computing Rational Points in Convex Semialgebraic Sets and Sum of Squares Decompositions. 2876-2889 - Santanu S. Dey
Constrained Infinite Group Relaxations of MIPs. 2890-2912 - Zdenek Dostál
An Optimal Algorithm for Minimization of Quadratic Functions with Bounded Spectrum Subject to Separable Convex Inequality and Linear Equality Constraints. 2913-2938 - Daniel Gourion, Dinh The Luc:
Finding Efficient Solutions by Free Disposal Outer Approximation. 2939-2958 - Liping Zhang, Soon-Yi Wu, Marco A. López
A New Exchange Method for Convex Semi-Infinite Programming. 2959-2977 - Iskander Aliev, Martin Henk
Feasibility of Integer Knapsacks. 2978-2993 - Chengjing Wang, Defeng Sun
Solving Log-Determinant Optimization Problems by a Newton-CG Primal Proximal Point Algorithm. 2994-3013 - Goran Lesaja, Cornelis Roos:
Unified Analysis of Kernel-Based Interior-Point Methods for P*(Kappa)-Linear Complementarity Problems. 3014-3039 - Luc Barbet, Aris Daniilidis
Generalized Hessians of C1, 1-Functions and Second-Order Viscosity Subjets. 3040-3058 - Zhisu Zhu, Anthony Man-Cho So
Universal Rigidity and Edge Sparsification for Sensor Network Localization. 3059-3081 - Hà Huy Vui, Pham Tien So'n:
Representations of Positive Polynomials and Optimization on Noncompact Semialgebraic Sets. 3082-3103 - Etienne de Klerk, Monique Laurent:
Error Bounds for Some Semidefinite Programming Approaches to Polynomial Minimization on the Hypercube. 3104-3120 - Leah Epstein, Asaf Levin
AFPTAS Results for Common Variants of Bin Packing: A New Method for Handling the Small Items. 3121-3145 - Emanuele Casini, Enrico Miglierina
The Geometry of Strict Maximality. 3146-3160 - Chi-Kong Ng, Duan Li
Global Descent Method for Global Optimization. 3161-3184 - Fabrizio Dabbene, Pavel S. Shcherbakov
A Randomized Cutting Plane Method with Probabilistic Geometric Convergence. 3185-3207 - K. W. Meng, X. Q. Yang:
Optimality Conditions via Exact Penalty Functions. 3208-3231 - Alfred Auslender, Ron Shefi, Marc Teboulle:
A Moving Balls Approximation Method for a Class of Smooth Constrained Minimization Problems. 3232-3259 - Damon Mosk-Aoyama, Tim Roughgarden, Devavrat Shah:
Fully Distributed Algorithms for Convex Optimization Problems. 3260-3279 - Alexander Kruger
Stability of Error Bounds for Convex Constraint Systems in Banach Spaces. 3280-3296 - Christoph Buchheim
Integer Programming Subject to Monomial Constraints. 3297-3311 - Damián R. Fernández
Sharp Primal Superlinear Convergence Results for Some Newtonian Methods for Constrained Optimization. 3312-3334 - Hiroshi Yamashita, Takahito Tanabe:
A Primal-Dual Exterior Point Method for Nonlinear Optimization. 3335-3363 - Jean B. Lasserre
Positivity and Optimization for Semi-Algebraic Functions. 3364-3383 - Vaithilingam Jeyakumar
Strong Duality in Robust Convex Programming: Complete Characterizations. 3384-3407 - Hans D. Mittelmann, Jiming Peng:
Estimating Bounds for Quadratic Assignment Problems Associated with Hamming and Manhattan Distance Matrices Based on Semidefinite Programming. 3408-3426 - Giuseppe Carlo Calafiore
Random Convex Programs. 3427-3464 - Ting Kei Pong
Trace Norm Regularization: Reformulations, Algorithms, and Multi-Task Learning. 3465-3489 - Boris S. Mordukhovich, Javier Peña, Vera Roshchina
Applying Metric Regularity to Compute a Condition Measure of a Smoothing Algorithm for Matrix Games. 3490-3511 - Katya Scheinberg
Self-Correcting Geometry in Model-Based Algorithms for Derivative-Free Unconstrained Optimization. 3512-3532 - Roberto Andreani, José Mario Martínez, Benar Fux Svaiter
A New Sequential Optimality Condition for Constrained Optimization and Algorithmic Consequences. 3533-3554 - Hongchao Zhang, Andrew R. Conn, Katya Scheinberg
A Derivative-Free Algorithm for Least-Squares Minimization. 3555-3576
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-18 20:35 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: