Pages that link to "Item:Q2756074"
From MaRDI portal
The following pages link to A Mathematical View of Interior-Point Methods in Convex Optimization (Q2756074):
Displayed 44 items.
- 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)
- 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)
- 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)
- 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)
- Separable self-concordant spectral functions and a conjecture of Tunçel (Q1960190) (← links)
- Multirate multicast service provisioning. II: A tâtonnement process for rate allocation (Q2460034) (← links)
- The convergence of an interior point method for an elliptic control problem with mixed control-state constraints (Q2479834) (← links)
- Selective Gram-Schmidt orthonormalization for conic cutting surface algorithms (Q2482686) (← links)
- Tractable approximations to robust conic optimization problems (Q2492681) (← links)
- A numerical procedure for inferring from experimental data the optimization cost functions using a multibody model of the neuro-musculoskeletal system (Q2505461) (← links)
- Extremum-seeking control of state-constrained nonlinear systems (Q2576111) (← links)
- Lexicographic differentiation of nonsmooth functions (Q2576740) (← links)
- Trajectory Optimization Strategies for Supercavitating Underwater Vehicles (Q3110973) (← links)
- Extreme points of well-posed polytopes (Q3446581) (← links)
- Several Jordan-algebraic aspects of optimization† (Q3507703) (← links)
- An interior-point trust-region polynomial algorithm for convex quadratic minimization subject to general convex constraints (Q3539793) (← links)
- Interior-point methods for optimization (Q3612043) (← links)
- NEWTON FLOW AND INTERIOR POINT METHODS IN LINEAR PROGRAMMING (Q5318371) (← links)
- Approximate minimum enclosing balls in high dimensions using core-sets (Q5463443) (← links)