Search results for "Math. Program."

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
1	Nick I. M. Gould, Philippe L. Toint	Erratum to: Nonlinear programming without a penalty function or a filter.	Math. Program.	2012	DBLP DOI BibTeX RDF
1	Guyslain Naves	The hardness of routing two pairs on one face.	Math. Program.	2012	DBLP DOI BibTeX RDF
1	Rida Laraki, J. B. Lasserre	Semidefinite programming for min-max problems and games.	Math. Program.	2012	DBLP DOI BibTeX RDF
1	Oliver Stein	Lifting mathematical programs with complementarity constraints.	Math. Program.	2012	DBLP DOI BibTeX RDF
1	Douglas A. G. Vieira, Ricardo H. C. Takahashi, Rodney R. Saldanha	Multicriteria optimization with a multiobjective golden section line search.	Math. Program.	2012	DBLP DOI BibTeX RDF
1	S. Dempe, J. Dutta	Is bilevel programming a special case of a mathematical program with complementarity constraints?	Math. Program.	2012	DBLP DOI BibTeX RDF
1	Alain Billionnet, Sourour Elloumi, Amélie Lambert	Extending the QCR method to general mixed-integer programs.	Math. Program.	2012	DBLP DOI BibTeX RDF
1	Frank Göring, Christoph Helmberg, Susanna Reiss	Graph realizations associated with minimizing the maximum eigenvalue of the Laplacian.	Math. Program.	2012	DBLP DOI BibTeX RDF
1	Zhaosong Lu, Renato D. C. Monteiro, Ming Yuan	Convex optimization methods for dimension reduction and coefficient estimation in multivariate linear regression.	Math. Program.	2012	DBLP DOI BibTeX RDF
1	Adam N. Letchford, Michael M. Sørensen	Binary positive semidefinite matrices and associated integer polytopes.	Math. Program.	2012	DBLP DOI BibTeX RDF
1	Zhisu Zhu, Chuangyin Dang, Yinyu Ye	A FPTAS for computing a symmetric Leontief competitive economy equilibrium.	Math. Program.	2012	DBLP DOI BibTeX RDF
1	Peter Bürgisser, Dennis Amelunxen	Robust smoothed analysis of a condition number for linear programming.	Math. Program.	2012	DBLP DOI BibTeX RDF
1	Jiawang Nie	First order conditions for semidefinite representations of convex sets defined by rational or singular polynomials.	Math. Program.	2012	DBLP DOI BibTeX RDF
1	Daniel Aloise, Pierre Hansen, Leo Liberti	An improved column generation algorithm for minimum sum-of-squares clustering.	Math. Program.	2012	DBLP DOI BibTeX RDF
1	Ying-Ju Chen, Jiawei Zhang	Design of price mechanisms for network resource allocation via price of anarchy.	Math. Program.	2012	DBLP DOI BibTeX RDF
1	Leo Liberti	Reformulations in mathematical programming: automatic symmetry detection and exploitation.	Math. Program.	2012	DBLP DOI BibTeX RDF
1	Retsef Levi, David B. Shmoys, Chaitanya Swamy	LP-based approximation algorithms for capacitated facility location.	Math. Program.	2012	DBLP DOI BibTeX RDF
1	Júlia Pap	Recognizing conic TDI systems is hard.	Math. Program.	2011	DBLP DOI BibTeX RDF
1	Wenhui Zhao, Marc E. Posner	A large class of facets for the K-median polytope.	Math. Program.	2011	DBLP DOI BibTeX RDF
1	Luis Gouveia, Luidi Simonetti, Eduardo Uchoa	Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs.	Math. Program.	2011	DBLP DOI BibTeX RDF
1	Gérard Cornuéjols, Leo Liberti, Giacomo Nannicini	Improved strategies for branching on general disjunctions.	Math. Program.	2011	DBLP DOI BibTeX RDF
1	Alper Atamtürk, Vishnu Narayanan	Lifting for conic mixed-integer programming.	Math. Program.	2011	DBLP DOI BibTeX RDF
1	John Dunagan, Daniel A. Spielman, Shang-Hua Teng	Smoothed analysis of condition numbers and complexity implications for linear programming.	Math. Program.	2011	DBLP DOI BibTeX RDF
1	Csaba I. Fábián, Gautam Mitra, Diana Roman	Processing second-order stochastic dominance models using cutting-plane representations.	Math. Program.	2011	DBLP DOI BibTeX RDF
1	Anatoli Juditsky, Arkadi Nemirovski	On verifiable sufficient conditions for sparse signal recovery via ℓ1 minimization.	Math. Program.	2011	DBLP DOI BibTeX RDF
1	Anthony Man-Cho So	Deterministic approximation algorithms for sphere constrained homogeneous polynomial optimization problems.	Math. Program.	2011	DBLP DOI BibTeX RDF
1	Wenbao Ai, Yongwei Huang, Shuzhong Zhang	New results on Hermitian matrix rank-one decomposition.	Math. Program.	2011	DBLP DOI BibTeX RDF
1	Gábor Rudolf, Nilay Noyan, Dávid Papp, Farid Alizadeh	Bilinear optimality constraints for the cone of positive polynomials.	Math. Program.	2011	DBLP DOI BibTeX RDF
1	Arrigo Zanette, Matteo Fischetti, Egon Balas	Lexicography and degeneracy: can a pure cutting plane algorithm work?	Math. Program.	2011	DBLP DOI BibTeX RDF
1	Xiaowei Bao, Nikolaos V. Sahinidis, Mohit Tawarmalani	Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons.	Math. Program.	2011	DBLP DOI BibTeX RDF
1	Aharon Ben-Tal, Sahely Bhadra, Chiranjib Bhattacharyya, J. Saketha Nath	Chance constrained uncertain classification via robust optimization.	Math. Program.	2011	DBLP DOI BibTeX RDF
1	Patrick D. Mackin, Asim Roy, Jyrki Wallenius	An interactive weight space reduction procedure for nonlinear multiple objective mathematical programming.	Math. Program.	2011	DBLP DOI BibTeX RDF
1	Miguel F. Anjos, Etienne de Klerk, Franz Rendl	Preface.	Math. Program.	2011	DBLP DOI BibTeX RDF
1	Matteo Fischetti, Andrea Lodi, Andrea Tramontani	On the separation of disjunctive cuts.	Math. Program.	2011	DBLP DOI BibTeX RDF
1	Toshihide Ibaraki, Takashi Imamichi, Yuichi Koga, Hiroshi Nagamochi, Koji Nonobe, Mutsunori Yagiura	Efficient branch-and-bound algorithms for weighted MAX-2-SAT.	Math. Program.	2011	DBLP DOI BibTeX RDF
1	Meisam Razaviyayn, Zhi-Quan Luo, Paul Tseng, Jong-Shi Pang	A stackelberg game approach to distributed spectrum management.	Math. Program.	2011	DBLP DOI BibTeX RDF
1	Juan Pablo Vielma, George L. Nemhauser	Modeling disjunctive constraints with a logarithmic number of binary variables and constraints.	Math. Program.	2011	DBLP DOI BibTeX RDF
1	Anureet Saxena, Pierre Bonami, Jon Lee	Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations.	Math. Program.	2011	DBLP DOI BibTeX RDF
1	Shu Lu	Implications of the constant rank constraint qualification.	Math. Program.	2011	DBLP DOI BibTeX RDF
1	Paul Tseng, Immanuel M. Bomze, Werner Schachinger	A first-order interior-point method for linearly constrained smooth optimization.	Math. Program.	2011	DBLP DOI BibTeX RDF
1	Zhaosong Lu	A computational study on robust portfolio selection based on a joint ellipsoidal uncertainty set.	Math. Program.	2011	DBLP DOI BibTeX RDF
1	Santanu S. Dey	A note on the split rank of intersection cuts.	Math. Program.	2011	DBLP DOI BibTeX RDF
1	Jochen Könemann, David Pritchard, Kunlun Tan	A partition-based relaxation for Steiner trees.	Math. Program.	2011	DBLP DOI BibTeX RDF
1	Jordi Castro, Jordi Cuesta	Quadratic regularizations in an interior-point method for primal block-angular problems.	Math. Program.	2011	DBLP DOI BibTeX RDF
1	Deeparnab Chakrabarty, Nikhil R. Devanur, Vijay V. Vazirani	New geometry-inspired relaxations and algorithms for the metric Steiner tree problem.	Math. Program.	2011	DBLP DOI BibTeX RDF
1	Khalid Addi, Bernard Brogliato, Daniel Goeleven	A qualitative mathematical analysis of a class of linear variational inequalities via semi-complementarity problems: applications in electronics.	Math. Program.	2011	DBLP DOI BibTeX RDF
1	Raymond Hemmecke, Shmuel Onn, Robert Weismantel	A polynomial oracle-time algorithm for convex integer minimization.	Math. Program.	2011	DBLP DOI BibTeX RDF
1	Dimitri P. Bertsekas	Incremental proximal methods for large scale convex optimization.	Math. Program.	2011	DBLP DOI BibTeX RDF
1	Sangwoon Yun, Paul Tseng, Kim-Chuan Toh	A block coordinate gradient descent method for regularized convex separable optimization and covariance selection.	Math. Program.	2011	DBLP DOI BibTeX RDF
1	Daniel Kuhn, Wolfram Wiesemann, Angelos Georghiou	Primal and dual linear decision rules in stochastic and robust optimization.	Math. Program.	2011	DBLP DOI BibTeX RDF
1	Marco Colombo, Jacek Gondzio, Andreas Grothey	A warm-start approach for large-scale stochastic linear programs.	Math. Program.	2011	DBLP DOI BibTeX RDF
1	James Ostrowski, Jeff Linderoth, Fabrizio Rossi, Stefano Smriglio	Orbital branching.	Math. Program.	2011	DBLP DOI BibTeX RDF
1	François Vanderbeck	Branching in branch-and-price: a generic scheme.	Math. Program.	2011	DBLP DOI BibTeX RDF
1	Alexandre d'Aspremont, Laurent El Ghaoui	Testing the nullspace property using semidefinite programming.	Math. Program.	2011	DBLP DOI BibTeX RDF
1	Joseph Geunes, Retsef Levi, H. Edwin Romeijn, David B. Shmoys	Approximation algorithms for supply chain planning and logistics problems with market choice.	Math. Program.	2011	DBLP DOI BibTeX RDF
1	Anatoli Juditsky, Fatma Kilinç-Karzan, Arkadi Nemirovski	Verifiable conditions of ℓ1-recovery for sparse signals with sign restrictions.	Math. Program.	2011	DBLP DOI BibTeX RDF
1	Yurii Nesterov	Barrier subgradient method.	Math. Program.	2011	DBLP DOI BibTeX RDF
1	Justo Puerto, Antonio M. Rodríguez-Chía	On the structure of the solution set for the single facility location problem with average distances.	Math. Program.	2011	DBLP DOI BibTeX RDF
1	Roberto Andreani, Joaquim João Júdice, J. M. Martínez, Joao Patrício	On the natural merit function for solving complementarity problems.	Math. Program.	2011	DBLP DOI BibTeX RDF
1	Dongdong Ge, Xiaoye Jiang, Yinyu Ye	A note on the complexity of Lp minimization.	Math. Program.	2011	DBLP DOI BibTeX RDF
1	Dimitri P. Bertsekas, Zhi-Quan Luo	Preface.	Math. Program.	2011	DBLP DOI BibTeX RDF
1	Amitabh Basu, Pierre Bonami, Gérard Cornuéjols, François Margot	On the relative strength of split, triangle and quadrilateral cuts.	Math. Program.	2011	DBLP DOI BibTeX RDF
1	Coralia Cartis, Nicholas I. M. Gould, Philippe L. Toint	Adaptive cubic regularisation methods for unconstrained optimization. Part I: motivation, convergence and numerical results.	Math. Program.	2011	DBLP DOI BibTeX RDF
1	Xiaojun Chen 0001, Shuhuang Xiang	Implicit solution function of P0 and Z matrix linear complementarity constraints.	Math. Program.	2011	DBLP DOI BibTeX RDF
1	Abdo Y. Alfakih	On bar frameworks, stress matrices and semidefinite programming.	Math. Program.	2011	DBLP DOI BibTeX RDF
1	Daya Ram Gaur, Ramesh Krishnamurti, Rajeev Kohli	Erratum to: The capacitated max k-cut problem.	Math. Program.	2011	DBLP DOI BibTeX RDF
1	Coralia Cartis, Nicholas I. M. Gould, Philippe L. Toint	Adaptive cubic regularisation methods for unconstrained optimization. Part II: worst-case function- and derivative-evaluation complexity.	Math. Program.	2011	DBLP DOI BibTeX RDF
1	Catarina P. Avelino, Javier M. Moguerza, Alberto Olivares, Francisco J. Prieto	Combining and scaling descent and negative curvature directions.	Math. Program.	2011	DBLP DOI BibTeX RDF
1	Ilan Lobel, Asuman E. Ozdaglar, Diego Feijer	Distributed multi-agent optimization with state-dependent communication.	Math. Program.	2011	DBLP DOI BibTeX RDF
1	Shabbir Ahmed, Alper Atamtürk	Maximizing a class of submodular utility functions.	Math. Program.	2011	DBLP DOI BibTeX RDF
1	Miroslav Karamanov, Gérard Cornuéjols	Branching on general disjunctions.	Math. Program.	2011	DBLP DOI BibTeX RDF
1	Xiaoye Jiang, Lek-Heng Lim, Yuan Yao, Yinyu Ye	Statistical ranking and combinatorial Hodge theory.	Math. Program.	2011	DBLP DOI BibTeX RDF
1	Ricardo Fukasawa, Marcos Goycoolea	On the exact separation of mixed integer knapsack cuts.	Math. Program.	2011	DBLP DOI BibTeX RDF
1	Thomas C. Sharkey, H. Edwin Romeijn, Joseph Geunes	A class of nonlinear nonseparable continuous knapsack and multiple-choice knapsack problems.	Math. Program.	2011	DBLP DOI BibTeX RDF
1	Luigi Grippo, Laura Palagi, Veronica Piccialli	An unconstrained minimization method for solving low-rank SDP relaxations of the maxcut problem.	Math. Program.	2011	DBLP DOI BibTeX RDF
1	Daniele Depetrini, Marco Locatelli	Approximation of linear fractional-multiplicative problems.	Math. Program.	2011	DBLP DOI BibTeX RDF
1	Etienne de Klerk, Cristian Dobre, Dmitrii V. Pasechnik	Numerical block diagonalization of matrix *-algebras with application to semidefinite programming.	Math. Program.	2011	DBLP DOI BibTeX RDF
1	V. Jeyakumar, G. Y. Li	Necessary global optimality conditions for nonlinear programming problems with polynomial constraints.	Math. Program.	2011	DBLP DOI BibTeX RDF
1	Shai Shalev-Shwartz, Yoram Singer, Nathan Srebro, Andrew Cotter	Pegasos: primal estimated sub-gradient solver for SVM.	Math. Program.	2011	DBLP DOI BibTeX RDF
1	Alexandre d'Aspremont, Francis R. Bach, Inderjit S. Dhillon, Bin Yu	Preface.	Math. Program.	2011	DBLP DOI BibTeX RDF
1	Benjamin Recht, Weiyu Xu, Babak Hassibi	Null space conditions and thresholds for rank minimization.	Math. Program.	2011	DBLP DOI BibTeX RDF
1	Guanghui Lan, Zhaosong Lu, Renato D. C. Monteiro	Primal-dual first-order methods with O(1/e) iteration-complexity for cone programming.	Math. Program.	2011	DBLP DOI BibTeX RDF
1	Anthony Man-Cho So	Moment inequalities for sums of random matrices and their applications in optimization.	Math. Program.	2011	DBLP DOI BibTeX RDF
1	Alexey F. Izmailov, Mikhail V. Solodov	On attraction of linearly constrained Lagrangian methods and of stabilized and quasi-Newton SQP methods to critical multipliers.	Math. Program.	2011	DBLP DOI BibTeX RDF
1	Vineet Goyal, Latife Genç Kaya, R. Ravi	An FPTAS for minimizing the product of two non-negative linear cost functions.	Math. Program.	2011	DBLP DOI BibTeX RDF
1	Xiaojin Zheng, Xiaoling Sun, Duan Li	Convex relaxations for nonconvex quadratically constrained quadratic programming: matrix cone decomposition and polyhedral approximation.	Math. Program.	2011	DBLP DOI BibTeX RDF
1	André Berger, Vincenzo Bonifaci, Fabrizio Grandoni, Guido Schäfer	Budgeted matching and budgeted matroid intersection via the gasoline puzzle.	Math. Program.	2011	DBLP DOI BibTeX RDF
1	Sunyoung Kim, Masakazu Kojima, Martin Mevissen, Makoto Yamashita	Exploiting sparsity in linear and nonlinear matrix inequalities via positive semidefinite matrix completion.	Math. Program.	2011	DBLP DOI BibTeX RDF
1	Lifeng Chen, Donald Goldfarb	An interior-point piecewise linear penalty method for nonlinear programming.	Math. Program.	2011	DBLP DOI BibTeX RDF
1	Gennadiy Averkov, Martin Henk	Representing simple d-dimensional polytopes by d polynomials.	Math. Program.	2011	DBLP DOI BibTeX RDF
1	Shiqian Ma, Donald Goldfarb, Lifeng Chen	Fixed point and Bregman iterative methods for matrix rank minimization.	Math. Program.	2011	DBLP DOI BibTeX RDF
1	Etienne de Klerk, Marianna E.-Nagy	On the complexity of computing the handicap of a sufficient matrix.	Math. Program.	2011	DBLP DOI BibTeX RDF
1	Ting Kei Pong, Paul Tseng	(Robust) Edge-based semidefinite programming relaxation of sensor network localization.	Math. Program.	2011	DBLP DOI BibTeX RDF
1	Martin K. Bernauer, Roland Griesse	A robustification approach in unconstrained quadratic optimization.	Math. Program.	2011	DBLP DOI BibTeX RDF
1	Xi Yin Zheng, Kung Fu Ng	Strong KKT conditions and weak sharp solutions in convex-composite optimization.	Math. Program.	2011	DBLP DOI BibTeX RDF
1	Ralf Gollmer, Uwe Gotzes, Rüdiger Schultz	A note on second-order stochastic dominance constraints induced by mixed-integer linear recourse.	Math. Program.	2011	DBLP DOI BibTeX RDF
1	Brendan P. W. Ames, Stephen A. Vavasis	Nuclear norm minimization for the planted clique and biclique problems.	Math. Program.	2011	DBLP DOI BibTeX RDF
1	Angelia Nedic	Random algorithms for convex minimization problems.	Math. Program.	2011	DBLP DOI BibTeX RDF
1	Krzysztof C. Kiwiel	An alternating linearization bundle method for convex optimization and nonlinear multicommodity flow problems.	Math. Program.	2011	DBLP DOI BibTeX RDF
1	Satoru Iwata, Mizuyo Takamatsu	Index minimization of differential-algebraic equations in hybrid analysis for circuit simulation.	Math. Program.	2010	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 15A22, 34A09, 65L80, 68Q25

Publications at "Math. Program."( http://dblp.L3S.de/Venues/Math._Program. )