Pages that link to "Item:Q4504779"
From MaRDI portal
The following pages link to A convergence analysis of the scaling-invariant primal-dual path-following algorithms for second-order cone programming (Q4504779):
Displaying 50 items.
- An inexact smoothing method for SOCCPs based on a one-parametric class of smoothing function (Q279269) (← links)
- A two-parametric class of merit functions for the second-order cone complementarity problem (Q364429) (← links)
- A proximal point algorithm for the monotone second-order cone complementarity problem (Q429513) (← links)
- Round-off estimates for second-order conic feasibility problems (Q447897) (← links)
- Weak infeasibility in second order cone programming (Q518144) (← links)
- The penalized Fischer-Burmeister SOC complementarity function (Q548683) (← links)
- A merit function method for infinite-dimensional SOCCPs (Q549841) (← links)
- Analysis of nonsmooth vector-valued functions associated with infinite-dimensional second-order cones (Q555108) (← links)
- Polynomial complexity of an interior point algorithm with a second order corrector step for symmetric cone programming (Q627455) (← links)
- A smoothing Newton method with Fischer-Burmeister function for second-order cone complementarity problems (Q639203) (← links)
- A primal-dual interior-point algorithm for second-order cone optimization with full Nesterov-Todd step (Q734862) (← links)
- A damped Gauss-Newton method for the second-order cone complementarity problem (Q836060) (← links)
- Two classes of merit functions for the second-order cone complementarity problem (Q857837) (← links)
- A one-parametric class of merit functions for the second-order cone complementarity problem (Q967218) (← links)
- Interior proximal methods and central paths for convex second-order cone programming (Q992842) (← links)
- A globally convergent non-interior point algorithm with full Newton step for second-order cone programming (Q993313) (← links)
- Primal-dual interior-point algorithms for second-order cone optimization based on kernel functions (Q1012072) (← links)
- Correlative sparsity in primal-dual interior-point methods for LP, SDP, and SOCP (Q1024721) (← links)
- Similarity and other spectral relations for symmetric cones (Q1573667) (← links)
- On a commutative class of search directions for linear programming over symmetric cones (Q1599289) (← links)
- A regularized smoothing Newton method for solving SOCCPs based on a new smoothing C-function (Q1644067) (← links)
- An extension of Chubanov's algorithm to symmetric cones (Q1717223) (← links)
- On self-regular IPMs (with comments and rejoinder) (Q1769946) (← links)
- A note on treating a second order cone program as a special case of a semidefinite program (Q1774167) (← links)
- Polynomial convergence of second-order mehrotra-type predictor-corrector algorithms over symmetric cones (Q1937004) (← links)
- A semismooth Newton method for SOCCPs based on a one-parametric class of SOC complementarity functions (Q2268920) (← links)
- A new complementarity function and applications in stochastic second-order cone complementarity problems (Q2314060) (← links)
- Some useful inequalities via trace function method in Euclidean Jordan algebras (Q2438327) (← links)
- A new interior-point algorithm based on modified Nesterov-Todd direction for symmetric cone linear complementarity problem (Q2448176) (← links)
- Primal-dual interior-point algorithms for second-order cone optimization based on a new parametric kernel function (Q2477797) (← links)
- A descent method for a reformulation of the second-order cone complementarity problem (Q2479359) (← links)
- On local convergence of sequential quadratically-constrained quadratic-programming type methods, with an extension to variational problems (Q2479835) (← links)
- Conditions for error bounds and bounded level sets of some merit functions for the second-order cone complementarity problem (Q2483044) (← links)
- A smoothing Newton algorithm for solving the monotone second-order cone complementarity problems (Q2511086) (← links)
- On the optimal parameter of a self-concordant barrier over a symmetric cone (Q2572885) (← links)
- An unconstrained smooth minimization reformulation of the second-order cone complementarity problem (Q2576724) (← links)
- An Introduction to Formally Real Jordan Algebras and Their Applications in Optimization (Q2802529) (← links)
- On the Implementation and Usage of SDPT3 – A Matlab Software Package for Semidefinite-Quadratic-Linear Programming, Version 4.0 (Q2802544) (← links)
- A large-update primal–dual interior-point algorithm for second-order cone optimization based on a new proximity function (Q2817226) (← links)
- Simplex-type algorithm for second-order cone programmes via semi-infinite programming reformulation (Q2829585) (← links)
- A New Iteration Large-Update Primal-Dual Interior-Point Method for Second-Order Cone Programming (Q2895672) (← links)
- Jordan-algebraic aspects of optimization: randomization (Q3161141) (← links)
- Interior Point Methods for Nonlinear Optimization (Q3569506) (← links)
- Two Classes of Merit Functions for Infinite-Dimensional Second Order Complimentary Problems (Q3590024) (← links)
- An extension of Chubanov's polynomial-time linear programming algorithm to second-order cone programming (Q4638909) (← links)
- The solution of euclidean norm trust region SQP subproblems via second-order cone programs: an overview and elementary introduction (Q4638912) (← links)
- An Inexact Augmented Lagrangian Method for Second-Order Cone Programming with Applications (Q5003212) (← links)
- An iteration primal–dual path-following method, based on wide neighbourhood and large update, for second-order cone programming (Q5169450) (← links)
- Quadratic convergence to the optimal solution of second-order conic optimization without strict complementarity (Q5198048) (← links)
- A feasible direction algorithm for nonlinear second-order cone programs (Q5238072) (← links)