Implementation of interior point methods for mixed semidefinite and second order cone optimization problems
From MaRDI portal
Publication:4405940
DOI10.1080/1055678021000045123zbMath1032.90021OpenAlexW2119080913MaRDI QIDQ4405940
Publication date: 2002
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/1055678021000045123
Related Items (38)
Stochastic subgradient descent method for large-scale robust chance-constrained support vector machines ⋮ On the convergence rate of the Halpern-iteration ⋮ Rapid smooth entry trajectory planning for high lift/drag hypersonic glide vehicles ⋮ A second-order cone cutting surface method: Complexity and application ⋮ Second-order cone programming formulation for consolidation analysis of saturated porous media ⋮ Three‐dimensional Mohr–Coulomb limit analysis using semidefinite programming ⋮ Implementation of a primal-dual method for SDP on a shared memory parallel architecture ⋮ Second-order cone programming approaches to static shakedown analysis in steel plasticity ⋮ On the estimation of robustness and filtering ability of dynamic biochemical networks under process delays, internal parametric perturbations and external disturbances ⋮ CVXGEN: a code generator for embedded convex optimization ⋮ Models and algorithms for distributionally robust least squares problems ⋮ Implementation of nonsymmetric interior-point methods for linear optimization over sparse matrix cones ⋮ A Geodesic Interior-Point Method for Linear Optimization over Symmetric Cones ⋮ Distributionally robust joint chance-constrained support vector machines ⋮ Warmstarting the homogeneous and self-dual interior point method for linear and conic quadratic problems ⋮ Robust optimization using computer experiments ⋮ Interior Point Methods for Nonlinear Optimization ⋮ Multi-start approach for an integer determinant maximization problem ⋮ A variational principle of elastoplasticity and its application to the modeling of frictional materials ⋮ Robust synchronization analysis in nonlinear stochastic cellular networks with time-varying delays, intracellular perturbations and intercellular noise ⋮ On the behavior of the homogeneous self-dual model for conic convex optimization ⋮ A survey on conic relaxations of optimal power flow problem ⋮ Validating numerical semidefinite programming solvers for polynomial invariants ⋮ Perfect Plasticity with Damage and Healing at Small Strains, Its Modeling, Analysis, and Computer Implementation ⋮ Quasistatic normal-compliance contact problem of visco-elastic bodies with Coulomb friction implemented by QP and SGBEM ⋮ Sparse semidefinite programs with guaranteed near-linear time complexity via dualized clique tree conversion ⋮ Primal-dual interior-point algorithms for second-order cone optimization based on kernel functions ⋮ A large-update primal–dual interior-point algorithm for second-order cone optimization based on a new proximity function ⋮ SeDuMi ⋮ Semidefinite and second-order cone optimization approach for the Toeplitz matrix approximation problem ⋮ Correlative sparsity in primal-dual interior-point methods for LP, SDP, and SOCP ⋮ Magnetic resonance tissue quantification using optimal bSSFP pulse-sequence design ⋮ Semidefinite characterization and computation of zero-dimensional real radical ideals ⋮ Numerical experiments with universal barrier functions for cones of Chebyshev systems ⋮ Increased certification of semi-device independent random numbers using many inputs and more post-processing ⋮ Robust spectral factor approximation of discrete-time frequency domain power spectras ⋮ Local-solution approach to quasistatic rate-independent mixed-mode delamination ⋮ A search for quantum coin-flipping protocols using optimization techniques
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new polynomial-time algorithm for linear programming
- Feasibility issues in a primal-dual interior-point method for linear programming
- Computational experience with a primal-dual interior point method for linear programming
- Applications of second-order cone programming
- A unified approach to interior point algorithms for linear complementary problems
- Symmetric primal-dual path-following algorithms for semidefinite programming
- Linear systems in Jordan algebras and primal-dual interior-point algorithms
- Euclidean Jordan algebras and interior-point algorithms
- Similarity and other spectral relations for symmetric cones
- On weighted centers for semidefinite programming
- Multiple centrality corrections in a primal-dual method for linear programming
- A simplified homogeneous and self-dual linear programming algorithm and its implementation
- General Interior-Point Maps and Existence of Weighted Paths for Nonlinear Semidefinite Complementarity Problems
- Interior-Point Methods for the Monotone Semidefinite Linear Complementarity Problem in Symmetric Matrices
- A Polynomial-Time Primal-Dual Affine Scaling Algorithm for Linear and Convex Quadratic Programming and Its Power Series Extension
- Matrix Analysis
- On the Implementation of a Primal-Dual Interior Point Method
- Path-Following Methods for Linear Programming
- On Implementing Mehrotra’s Predictor–Corrector Interior-Point Method for Linear Programming
- Primal-Dual Interior-Point Methods for Semidefinite Programming: Convergence Rates, Stability and Numerical Results
- On the Nesterov--Todd Direction in Semidefinite Programming
- On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
- Feature Article—Interior Point Methods for Linear Programming: Computational State of the Art
- Commentary—Major Cholesky Would Feel Proud
- An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm
- Linear Matrix Inequalities in System and Control Theory
- Self-Scaled Barriers and Interior-Point Methods for Convex Programming
- On a Wide Region of Centers and Primal-Dual Interior Point Algorithms for Linear Programming
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Primal--Dual Path-Following Algorithms for Semidefinite Programming
- Primal-Dual Interior-Point Methods for Self-Scaled Cones
- On Extending Some Primal--Dual Interior-Point Algorithms From Linear Programming to Semidefinite Programming
- Existence and Uniqueness of Search Directions in Interior-Point Algorithms for the SDP and the Monotone SDLCP
- A study of search directions in primal-dual interior-point methods for semidefinite programming
- Extending Mehrotra and Gondzio higher order methods to mixed semidefinite-quadratic-linear programming
- SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
- An Interior-Point Method for Semidefinite Programming
- An Investigation of Interior-Point Algorithms for the Linear Transportation Problem
This page was built for publication: Implementation of interior point methods for mixed semidefinite and second order cone optimization problems
