scientific article; zbMATH DE number 1534294
From MaRDI portal
Publication:4517103
Cited in
(28)- A smoothing Newton algorithm based on a one-parametric class of smoothing functions for linear programming over symmetric cones
- Product-form Cholesky factorization in interior point methods for second-order cone programming
- Approximation algorithms for MAX-3-CUT and other problems via complex semidefinite programming
- Dimension reduction for semidefinite programs via Jordan algebras
- A semismooth Newton method for SOCCPs based on a one-parametric class of SOC complementarity functions
- A \({\mathcal {VU}}\)-decomposition method for a second-order cone programming problem
- A Newton's method for perturbed second-order cone programs
- Smoothing Newton algorithm for symmetric cone complementarity problems based on a one-parametric class of smoothing functions
- A descent method for a reformulation of the second-order cone complementarity problem
- Conditions for error bounds and bounded level sets of some merit functions for the second-order cone complementarity problem
- On the optimal parameter of a self-concordant barrier over a symmetric cone
- An unconstrained smooth minimization reformulation of the second-order cone complementarity problem
- An introduction to formally real Jordan algebras and their applications in optimization
- Complementarity problems over symmetric cones: A survey of recent developments in several aspects
- Recent Progress in Interior-Point Methods: Cutting-Plane Algorithms and Warm Starts
- New complexity analysis for primal-dual interior-point methods for self-scaled optimization problems
- An algorithm for nonsymmetric conic optimization inspired by MOSEK
- A polynomial primal-dual affine scaling algorithm for symmetric conic optimization
- The Q method for symmetric cone programming
- Parametric conic optimization problems over semidefinite plus nonnegative cone
- Non-exposed polyhedral faces of the completely positive cone
- Unifying optimal partition approach to sensitivity analysis in conic optimization
- Bilinear optimality constraints for the cone of positive polynomials
- Two classes of merit functions for the second-order cone complementarity problem
- Convexity and differentiability properties of spectral functions and spectral mappings on Euclidean Jordan algebras
- Smoothing algorithms for complementarity problems over symmetric cones
- A one-parametric class of merit functions for the second-order cone complementarity problem
- On the regularity of second order cone programs and an application to solving large scale problems
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4517103)
