A mathematical view of interior-point methods in convex optimization
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Projective re-normalization for improving the behavior of a homogeneous conic linear system
- A continuous d-step conjecture for polytopes
- New stopping criteria for detecting infeasibility in conic optimization
- Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method
- Implementation of warm-start strategies in interior-point methods for linear programming in fixed dimension
- On the complexity of the primal self-concordant barrier method.
- Improved approximation results on standard quartic polynomial optimization
- Exact duals and short certificates of infeasibility and weak infeasibility in conic linear programming
- 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
- Learning semidefinite regularizers
- The mixing time of the Dikin walk in a polytope -- a simple proof
- The Kantorovich theorem and interior point methods
- On self-regular IPMs (with comments and rejoinder)
- Discretization method for semi-definite programming
- Improving complexity of structured convex optimization problems using self-concordant barriers
- How to generate weakly infeasible semidefinite programs via Lasserre's relaxations for polynomial optimization
- A primal barrier function phase I algorithm for nonsymmetric conic optimization problems
- Separable self-concordant spectral functions and a conjecture of Tunçel
- Finite Blaschke products with prescribed critical points, Stieltjes polynomials, and moment problems
- A new algorithm for concave quadratic programming
- Optimal step length for the Newton method: case of self-concordant functions
- Strong duality for standard convex programs
- Cubic regularized Newton method for the saddle point models: a global and local convergence analysis
- A new primal-dual interior-point method for semidefinite optimization based on a parameterized kernel function
- Sieve-SDP: a simple facial reduction algorithm to preprocess semidefinite programs
- An exterior point polynomial-time algorithm for convex quadratic programming
- An empirical evaluation of walk-and-round heuristics for mixed integer linear programs
- Antenna array synthesis with clusters of unmanned aerial vehicles
- An entire space polynomial-time algorithm for linear programming
- Multirate multicast service provisioning. II: A tâtonnement process for rate allocation
- The convergence of an interior point method for an elliptic control problem with mixed control-state constraints
- Selective Gram-Schmidt orthonormalization for conic cutting surface algorithms
- Tractable approximations to robust conic optimization problems
- A numerical procedure for inferring from experimental data the optimization cost functions using a multibody model of the neuro-musculoskeletal system
- Intrinsic volumes of symmetric cones and applications in convex programming
- Extremum-seeking control of state-constrained nonlinear systems
- Lexicographic differentiation of nonsmooth functions
- A second-order method for strongly convex \(\ell _1\)-regularization problems
- Terracini convexity
- A simplified treatment of Ramana's exact dual for semidefinite programming
- New bounds for nonconvex quadratically constrained quadratic programming
- Modeling approaches for addressing unrelaxable bound constraints with unconstrained optimization methods
- Convergence of a weighted barrier algorithm for stochastic convex quadratic semidefinite optimization
- Exponential varieties
- Complementarity problems over symmetric cones: A survey of recent developments in several aspects
- On the Turing model complexity of interior point methods for semidefinite programming
- Low-rank approximation and completion of positive tensors
- Bearing capacity of shallow foundations in transversely isotropic granular media
- A self-concordant interior point approach for optimal control with state constraints
- Bad semidefinite programs: they all look the same
- Trajectory Optimization Strategies for Supercavitating Underwater Vehicles
- Extreme points of well-posed polytopes
- A hybrid proximal extragradient self-concordant primal barrier method for monotone variational inequalities
- Several Jordan-algebraic aspects of optimization†
- An interior-point trust-region polynomial algorithm for convex quadratic minimization subject to general convex constraints
- Interior-point methods for optimization
- New complexity analysis for primal-dual interior-point methods for self-scaled optimization problems
- Computation of channel capacity based on self-concordant functions
- On complexity analysis of the primal-dual interior-point method for semidefinite optimization problem based on a new proximity function
- scientific article; zbMATH DE number 590363 (Why is no real title available?)
- scientific article; zbMATH DE number 1047674 (Why is no real title available?)
- Analysis of microstructures and phase transition phenomena in one-dimensional, non-linear elasticity by convex optimization
- An interior-point trust-region algorithm for quadratic stochastic symmetric programming
- \(LDL^T\) direction interior point method for semidefinite programming
- A long-step feasible predictor–corrector interior-point algorithm for symmetric cone optimization
- Sum-of-squares optimization without semidefinite programming
- A long-step interior-point algorithm for symmetric cone Cartesian P_ ()-HLCP
- scientific article; zbMATH DE number 1862745 (Why is no real title available?)
- scientific article; zbMATH DE number 1889340 (Why is no real title available?)
- A generic interior-point algorithm for monotone symmetric cone linear complementarity problems based on a new kernel function
- Nearly-linear work parallel SDD solvers, low-diameter decomposition, and low-stretch subgraphs
- A Survey on Analog Models of Computation
- Dual certificates and efficient rational sum-of-squares decompositions for polynomial optimization over compact sets
- On the computability of continuous maximum entropy distributions with applications
- Legendre transform and applications to finite and infinite optimization
- Complexity Analysis of a Sampling-Based Interior Point Method for Convex Optimization
- Alfonso: Matlab Package for Nonsymmetric Conic Optimization
- An Analytic Center Cutting Plane Method to Determine Complete Positivity of a Matrix
- Logarithmic-barrier decomposition interior-point methods for stochastic linear optimization in a Hilbert space
- Worst-case convergence analysis of inexact gradient and Newton methods through semidefinite programming performance estimation
- Hardness results for structured linear systems
- Globally Solving Nonconvex Quadratic Programs via Linear Integer Programming Techniques
- Stationary distributions of continuous-time Markov chains: a review of theory and truncation-based approximations
- Refining the partition for multifold conic optimization problems
- A self-concordant exponential kernel function for primal-dual interior-point algorithm
- A single-phase, proximal path-following framework
- Inexact proximal Newton methods for self-concordant functions
- Characterizing bad semidefinite programs: normal forms and short proofs
- Diameter and Curvature: Intriguing Analogies
- NEWTON FLOW AND INTERIOR POINT METHODS IN LINEAR PROGRAMMING
- Branching on hyperplane methods for mixed integer linear and convex programming using adjoint lattices
- Approximate minimum enclosing balls in high dimensions using core-sets
- Book Review: The basic George B. Dantzig
- Exact Duality in Semidefinite Programming Based on Elementary Reformulations
- Probabilistic analyses of condition numbers
- Application of facial reduction to H_ state feedback control problem
- Preprocessing and regularization for degenerate semidefinite programs
- scientific article; zbMATH DE number 4185410 (Why is no real title available?)
- Introduction to continuous optimization
- A new outlier detection method based on convex optimization: application to diagnosis of Parkinson's disease
This page was built for publication: A mathematical view of interior-point methods in convex optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2756074)
