Results 41 to 50 of about 26,938 (149)
Square-Root Lasso: Pivotal Recovery of Sparse Signals via Conic Programming [PDF]
, 2011 We propose a pivotal method for estimating high-dimensional sparse linear regression models, where the overall number of regressors $p$ is large, possibly much larger than $n$, but only $s$ regressors are significant.
Belloni, Alexandre +2 more
core +3 more sources
All Real Eigenvalues of Symmetric Tensors
, 2014 This paper studies how to compute all real eigenvalues of a symmetric tensor. As is well known, the largest or smallest eigenvalue can be found by solving a polynomial optimization problem, while the other middle eigenvalues can not.
Cui, Chun-Feng +2 more
core +1 more source
Fast Second-order Cone Programming for Safe Mission Planning
, 2017 This paper considers the problem of safe mission planning of dynamic systems operating under uncertain environments. Much of the prior work on achieving robust and safe control requires solving second-order cone programs (SOCP).
Jain, Prateek +2 more
core +1 more source
Primal and dual active-set methods for convex quadratic programming
, 2015 Computational methods are proposed for solving a convex quadratic program (QP). Active-set methods are defined for a particular primal and dual formulation of a QP with general equality constraints and simple lower bounds on the variables.
Forsgren, Anders +2 more
core +1 more source
An infeasible full NT-step interior point method for circular optimization
Numerical Algebra, Control & Optimization, 2017 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kheirfam, Behrouz, Wang, Guoqiang
openaire +3 more sources
Convergence of infeasible-interior-point methods for self-scaled conic programming
, 2003 Convergence of infeasible-interior-point methods for self-scaled conic ...
Rangarajan, B.K., Todd, M. J.
core
Filter-And-Forward Distributed Beamforming in Relay Networks with Frequency Selective Fading
, 2009 A new approach to distributed cooperative beamforming in relay networks with frequency selective fading is proposed. It is assumed that all the relay nodes are equipped with finite impulse response (FIR) filters and use a filter-and-forward (FF) strategy
Chen, Haihua +2 more
core +2 more sources
Polynomial Convergence of Infeasible-Interior-Point Methods Over Symmetric Cones
, 2004 Polynomial Convergence of Infeasible-Interior-Point Methods Over Symmetric ...
Rangarajan, B.
core
On Simplex Pivoting Rules and Complexity Theory
, 2014 We show that there are simplex pivoting rules for which it is PSPACE-complete to tell if a particular basis will appear on the algorithm's path. Such rules cannot be the basis of a strongly polynomial algorithm, unless P = PSPACE.
Adler, Ilan +2 more
core +1 more source
Getting Feasible Variable Estimates From Infeasible Ones: MRF Local Polytope Study [PDF]
, 2012 This paper proposes a method for construction of approximate feasible primal solutions from dual ones for large-scale optimization problems possessing certain separability properties.
Savchynskyy, Bogdan, Schmidt, Stefan
core