Pages that link to "Item:Q2756074"

The following pages link to A Mathematical View of Interior-Point Methods in Convex Optimization (Q2756074):

Displaying 50 items.

• A second-order method for strongly convex \(\ell _1\)-regularization problems (Q263191) (← links)
• New complexity analysis for primal-dual interior-point methods for self-scaled optimization problems (Q383382) (← links)
• Computation of channel capacity based on self-concordant functions (Q415822) (← links)
• On complexity analysis of the primal-dual interior-point method for semidefinite optimization problem based on a new proximity function (Q425872) (← links)
• Analysis of microstructures and phase transition phenomena in one-dimensional, non-linear elasticity by convex optimization (Q445496) (← links)
• A generic interior-point algorithm for monotone symmetric cone linear complementarity problems based on a new kernel function (Q483254) (← links)
• Nearly-linear work parallel SDD solvers, low-diameter decomposition, and low-stretch subgraphs (Q487267) (← links)
• Legendre transform and applications to finite and infinite optimization (Q505632) (← links)
• Inexact proximal Newton methods for self-concordant functions (Q522088) (← links)
• Branching on hyperplane methods for mixed integer linear and convex programming using adjoint lattices (Q537960) (← links)
• Implementation of nonsymmetric interior-point methods for linear optimization over sparse matrix cones (Q621748) (← links)
• Conic systems and sublinear mappings: equivalent approaches. (Q703260) (← links)
• Barrier function based model predictive control (Q705163) (← links)
• Causal structure and algebraic classification of non-dissipative linear optical media (Q710449) (← links)
• Smaller SDP for SOS decomposition (Q746820) (← links)
• A polynomial-time interior-point method for circular cone programming based on kernel functions (Q747043) (← links)
• Generalized derivatives and nonsmooth optimization, a finite dimensional tour (with comments and rejoinder) (Q819950) (← links)
• Interior-point Lagrangian decomposition method for separable convex optimization (Q846931) (← links)
• Universal duality in conic convex optimization (Q868444) (← links)
• A primal-dual symmetric relaxation for homogeneous conic systems (Q883335) (← links)
• Stochastic 0-1 linear programming under limited distributional information (Q935201) (← links)
• Polytopes and arrangements: diameter and curvature (Q935228) (← links)
• On hyperbolicity cones associated with elementary symmetric polynomials (Q941028) (← links)
• Semidefinite programming and arithmetic circuit evaluation (Q943844) (← links)
• Parabolic target space and primal-dual interior-point methods (Q943845) (← links)
• Hardness-packing density scaling relations for cohesive-frictional porous materials (Q957449) (← links)
• Risk management in uncapacitated facility location models with random demands (Q958433) (← links)
• An interior-point method for the single-facility location problem with mixed norms using a conic formulation (Q999133) (← links)
• Projective re-normalization for improving the behavior of a homogeneous conic linear system (Q1016122) (← links)
• A continuous \(d\)-step conjecture for polytopes (Q1017920) (← links)
• New stopping criteria for detecting infeasibility in conic optimization (Q1024728) (← links)
• Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method (Q1025986) (← links)
• Implementation of warm-start strategies in interior-point methods for linear programming in fixed dimension (Q1029621) (← links)
• On the complexity of the primal self-concordant barrier method. (Q1412708) (← links)
• Improved approximation results on standard quartic polynomial optimization (Q1686564) (← links)
• Exact duals and short certificates of infeasibility and weak infeasibility in conic linear programming (Q1702782) (← links)
• Optimization approaches to quadrature: new characterizations of Gaussian quadrature on the line and quadrature with few nodes on plane algebraic curves, on the plane and in higher dimensions (Q1704603) (← links)
• Learning semidefinite regularizers (Q1740575) (← links)
• The mixing time of the Dikin walk in a polytope -- a simple proof (Q1755831) (← links)
• The Kantorovich theorem and interior point methods (Q1769068) (← links)
• On self-regular IPMs (with comments and rejoinder) (Q1769946) (← links)
• Discretization method for semi-definite programming (Q1770709) (← links)
• Improving complexity of structured convex optimization problems using self-concordant barriers (Q1848383) (← links)
• How to generate weakly infeasible semidefinite programs via Lasserre's relaxations for polynomial optimization (Q1926632) (← links)
• A primal barrier function phase I algorithm for nonsymmetric conic optimization problems (Q1926650) (← links)
• Separable self-concordant spectral functions and a conjecture of Tunçel (Q1960190) (← links)
• Finite Blaschke products with prescribed critical points, Stieltjes polynomials, and moment problems (Q1999819) (← links)
• A new algorithm for concave quadratic programming (Q2010088) (← links)
• Optimal step length for the Newton method: case of self-concordant functions (Q2067259) (← links)
• Strong duality for standard convex programs (Q2074838) (← links)