Search results for "90C51"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
22	Anhua Lin	On a special class of regularized central paths for semidefinite programs.	Math. Program.	2010	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 49M29, 90C22, 90C51, 90C46
22	Hossein Mansouri, Cornelis Roos	A new full-Newton step O(n) infeasible interior-point algorithm for semidefinite optimization.	Numer. Algorithms	2009	DBLP DOI BibTeX RDF	Mathematics Subject Classifications (2000) 90C05, 90C51
22	Alexandre Belloni, Robert M. Freund	Projective re-normalization for improving the behavior of a homogeneous conic linear system.	Math. Program.	2009	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 90C05, 90C25, 90C51
22	Michael Ulbrich, Stefan Ulbrich	Primal-dual interior-point methods for PDE-constrained optimization.	Math. Program.	2009	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 90C51, 65K10, 49M15, 90C48
22	Emil Ernst, Michel Théra	On the necessity of the Moreau-Rockafellar-Robinson qualification condition in Banach spaces.	Math. Program.	2009	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 90C46, 90C51, 49K40, 46N10
22	Yurii E. Nesterov, Arkadi Nemirovski	Primal Central Paths and Riemannian Distances for Convex Sets.	Found. Comput. Math.	2008	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 52A41, 53C22, 90C25, 68Q25, 90C22, 90C51, 90C60
22	Chek Beng Chua	Analyticity of weighted central paths and error bounds for semidefinite programming.	Math. Program.	2008	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 90C22, 90C25, 90C51
22	Antoine Deza, Eissa Nematollahi, Tamás Terlaky	How good are interior point methods? Klee-Minty cubes tighten iteration-complexity bounds.	Math. Program.	2008	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) Primary 90C05, Secondary 90C51, Secondary 90C27, Secondary 52B12
22	Regina Sandra Burachik, L. Mauricio Graña Drummond, Susana Scheimberg	On some properties and an application of the logarithmic barrier method.	Math. Program.	2008	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 90C25, 90C51, 90C29
22	Kim-Chuan Toh	An inexact primal-dual path following algorithm for convex quadratic SDP.	Math. Program.	2008	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 90C22, 90C25, 90C51, 65F10
22	Michael J. Todd	Dual versus primal-dual interior-point methods for linear and conic programming.	Math. Program.	2008	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 90C25, 90C51
22	Paul Armand, Joël Benoist	A local convergence property of primal-dual methods for nonlinear programming.	Math. Program.	2008	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 65K05, 90C30, 90C51, 90C06, 90C26
22	Chek Beng Chua, Levent Tunçel	Invariance and efficiency of convex representations.	Math. Program.	2008	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 90C22, 52A41, 90C25, 90C51
22	Yinyu Ye 0001	A path to the Arrow-Debreu competitive market equilibrium.	Math. Program.	2008	DBLP DOI BibTeX RDF	Mathematics Subject Classifications 91B50, 90C25, 90C51
22	Renato D. C. Monteiro, Takashi Tsuchiya	A strong bound on the integral of the central path curvature and its relationship with the iteration-complexity of primal-dual path-following LP algorithms.	Math. Program.	2008	DBLP DOI BibTeX RDF	Mathematics Subject Classification 65K05, 68Q25, 90C51, 90C05, 90C60
22	Zhongyi Liu, Wenyu Sun	An infeasible interior-point algorithm with full-Newton step for linear optimization.	Numer. Algorithms	2007	DBLP DOI BibTeX RDF	Mathematics Subject Classifications (2000) 65K05, 90C51
22	Zhaosong Lu, Arkadi Nemirovski, Renato D. C. Monteiro	Large-scale semidefinite programming via a saddle point Mirror-Prox algorithm.	Math. Program.	2007	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 90C22, 90C25, 90C51, 65K10
22	Robert M. Freund, Fernando Ordóñez, Kim-Chuan Toh	Behavioral measures and their correlation with IPM iteration counts on semi-definite programming problems.	Math. Program.	2007	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 90-04, 90C22, 90C51, 90C60
22	Franz Rendl, Renata Sotirov	Bounds for the quadratic assignment problem using the bundle method.	Math. Program.	2007	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 90C22, 90C27, 90C57, 90C51, 90C06
22	K. A. Ariyawansa, Yuntao Zhu	Stochastic semidefinite programming: a new paradigm for stochastic optimization.	4OR	2006	DBLP DOI BibTeX RDF	MSC Classification 90C15, 90C51, 90C05
22	Robert M. Freund	On the behavior of the homogeneous self-dual model for conic convex optimization.	Math. Program.	2006	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 90C05, 90C25, 90C22, 90C31, 90C51, 90C46
22	Andreas Wächter, Lorenz T. Biegler	On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming.	Math. Program.	2006	DBLP DOI BibTeX RDF	Mathematical Subject Classification (2000): 49M37, 90C30, 65K05, 90C51
22	Arjan Berkelaar, Joaquim A. S. Gromicho, Roy Kouwenberg, Shuzhong Zhang	A Primal-Dual Decomposition Algorithm for Multistage Stochastic Convex Programming.	Math. Program.	2005	DBLP DOI BibTeX RDF	Mathematics Subject Classification (1991) 90C15, 90C25, 90C51, 90C06