The following pages link to (Q4324980):
Displaying 50 items.
- New permanent approximation inequalities via identities (Q779828) (← links)
- Sparse hierarchical regression with polynomials (Q782451) (← links)
- Generalized derivatives and nonsmooth optimization, a finite dimensional tour (with comments and rejoinder) (Q819950) (← links)
- On box-constrained total least squares problem (Q827567) (← links)
- A global linear and local superlinear (quadratic) inexact non-interior continuation method for variational inequalities over general closed convex sets (Q829878) (← links)
- Kantorovich's majorants principle for Newton's method (Q842767) (← links)
- On representations of the feasible set in convex optimization (Q845546) (← links)
- Interior-point Lagrangian decomposition method for separable convex optimization (Q846931) (← links)
- Convex duality and calculus: Reduction to cones (Q846945) (← links)
- Detecting rigid convexity of bivariate polynomials (Q847211) (← links)
- Semidefinite representation of convex sets (Q847843) (← links)
- Using ACCPM in a simplicial decomposition algorithm for the traffic assignment problem (Q849087) (← links)
- On verified numerical computations in convex programming (Q849186) (← links)
- On two measures of problem instance complexity and their correlation with the performance of SeDuMi on second-order cone problems (Q853555) (← links)
- A smoothing Newton-type algorithm of stronger convergence for the quadratically constrained convex quadratic programming (Q853883) (← links)
- Analysis of a smoothing method for symmetric conic linear programming (Q854421) (← links)
- \(H_{2}\) guaranteed cost fuzzy control design for discrete-time nonlinear systems with parameter uncertainty (Q856540) (← links)
- Improving the efficiency of the branch and bound algorithm for integer programming based on ``flatness'' information (Q858332) (← links)
- Joint routing and rate allocation for multiple video streams in ad-hoc wireless networks (Q859014) (← links)
- Noncommutative convexity arises from linear matrix inequalities (Q860776) (← links)
- Stochastic semidefinite programming: a new paradigm for stochastic optimization (Q862822) (← links)
- Optimal scaling of a gradient method for distributed resource allocation (Q868539) (← links)
- Cross-directional control of sheet and film processes (Q869064) (← links)
- A compressed primal-dual method for generating bivariate cubic \(L_{1}\) splines (Q869526) (← links)
- Semi-infinite programming (Q869581) (← links)
- Newton's method and its use in optimization (Q877590) (← links)
- A Newton-like method for solving rank constrained linear matrix inequalities (Q880379) (← links)
- A primal-dual symmetric relaxation for homogeneous conic systems (Q883335) (← links)
- A class of volumetric barrier decomposition algorithms for stochastic quadratic programming (Q884639) (← links)
- The \(D\)-decomposition technique for linear matrix inequalities (Q885770) (← links)
- D-admissible hybrid control of a class of singular systems (Q894304) (← links)
- Border basis relaxation for polynomial optimization (Q898268) (← links)
- Sparse representation based Fisher discrimination dictionary learning for image classification (Q901802) (← links)
- Anisotropy preserving DTI processing (Q903456) (← links)
- Differential properties of Euclidean projection onto power cone (Q907372) (← links)
- Exponential synchronization of general chaotic delayed neural networks via hybrid feedback (Q926122) (← links)
- Robust stability analysis of switched Hopfield neural networks with time-varying delay under uncertainty (Q936977) (← links)
- A generalization of Müller's iteration method based on standard information (Q937186) (← links)
- On hyperbolicity cones associated with elementary symmetric polynomials (Q941028) (← links)
- Equivalence of some stability criteria for linear time-delay systems (Q941520) (← links)
- Parabolic target space and primal-dual interior-point methods (Q943845) (← links)
- Conversion of some classes of fractional programming to second-order cone programming and solving it by potential reduction interior point method (Q945403) (← links)
- Active constraint set invariancy sensitivity analysis in linear optimization (Q946305) (← links)
- On the convexity of a class of quadratic mappings and its application to the problem of finding the smallest ball enclosing a given intersection of balls (Q946350) (← links)
- On the Behrens-Fisher problem: a globally convergent algorithm and a finite-sample study of the Wald, LR and LM tests (Q955145) (← links)
- Largest dual ellipsoids inscribed in dual cones (Q959981) (← links)
- Maximum likelihood estimation of ordered multinomial probabilities by geometric programming (Q961209) (← links)
- On the number of matrices and a random matrix with prescribed row and column sums and 0-1 entries (Q962158) (← links)
- Coherent quantum LQG control (Q963775) (← links)
- Set-membership filtering for systems with sensor saturation (Q963787) (← links)
