Pages that link to "Item:Q1591356"

The following pages link to Polynomial convergence of primal-dual algorithms for the second-order cone program based on the MZ-family of directions (Q1591356):

Displaying 50 items.

• An inexact smoothing method for SOCCPs based on a one-parametric class of smoothing function (Q279269) (← links)
• Continuous multifacility ordered median location problems (Q322399) (← links)
• An alternating direction method for second-order conic programming (Q336362) (← links)
• A two-parametric class of merit functions for the second-order cone complementarity problem (Q364429) (← links)
• A full Nesterov-Todd step infeasible interior-point method for second-order cone optimization (Q378264) (← links)
• Second-order cone programming with warm start for elastoplastic analysis with von Mises yield criterion (Q400001) (← links)
• A proximal point algorithm for the monotone second-order cone complementarity problem (Q429513) (← links)
• A power penalty method for second-order cone nonlinear complementarity problems (Q492069) (← links)
• Weak infeasibility in second order cone programming (Q518144) (← links)
• Two new predictor-corrector algorithms for second-order cone programming (Q536560) (← 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 working set SQCQP algorithm with simple nonmonotone penalty parameters (Q654747) (← links)
• A new one-step smoothing Newton method for second-order cone programming. (Q713481) (← 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)
• Computational strategy for Russell measure in DEA: second-order cone programming (Q869200) (← links)
• The solution set structure of monotone linear complementarity problems over second-order cone (Q924890) (← 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)
• A sequential quadratically constrained quadratic programming method for unconstrained minimax problems (Q1039448) (← links)
• Sequential quadratically constrained quadratic programming norm-relaxed algorithm of strongly sub-feasible directions (Q1044081) (← links)
• On a commutative class of search directions for linear programming over symmetric cones (Q1599289) (← links)
• The modulus-based matrix splitting iteration methods for second-order cone linear complementarity problems (Q1625774) (← links)
• Primal Newton method for the linear cone programming problem (Q1644012) (← links)
• A regularized smoothing Newton method for solving SOCCPs based on a new smoothing C-function (Q1644067) (← links)
• An alternating direction method for convex quadratic second-order cone programming with bounded constraints (Q1665536) (← links)
• The relaxation modulus-based matrix splitting iteration methods for circular cone nonlinear complementarity problems (Q1715729) (← links)
• An extension of Chubanov's algorithm to symmetric cones (Q1717223) (← links)
• A note on treating a second order cone program as a special case of a semidefinite program (Q1774167) (← links)
• Conditions for error bounds of linear complementarity problems over second-order cones with pseudomonotonicity (Q1782218) (← links)
• A power penalty method for second-order cone linear complementarity problems (Q1785626) (← links)
• Covering problems with polyellipsoids: a location analysis perspective (Q2028797) (← links)
• Alternate solution approaches for competitive hub location problems (Q2029306) (← links)
• A modified LM algorithm for tensor complementarity problems over the circular cone (Q2043190) (← links)
• An approximate lower order penalty approach for solving second-order cone linear complementarity problems (Q2154446) (← links)
• Generalized lower-order penalty algorithm for solving second-order cone mixed complementarity problems (Q2222129) (← links)
• Extension of the LP-Newton method to conic programming problems via semi-infinite representation (Q2225528) (← 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)
• Quadratically constraint quadratical algorithm model for nonlinear minimax problems (Q2378762) (← links)
• A variant of the affine-scaling method for a second-order cone program (Q2424199) (← links)
• Some useful inequalities via trace function method in Euclidean Jordan algebras (Q2438327) (← links)
• An SQP-type algorithm for nonlinear second-order cone programs (Q2458912) (← links)