Pages that link to "Item:Q5189561"

The following pages link to On the Local Convergence of Semismooth Newton Methods for Linear and Nonlinear Second-Order Cone Programs Without Strict Complementarity (Q5189561):

Displaying 50 items.

• The use of squared slack variables in nonlinear second-order cone programming (Q306383) (← links)
• An alternating direction method for second-order conic programming (Q336362) (← links)
• A semi-smooth Newton method for projection equations and linear complementarity problems with respect to the second order cone (Q344895) (← links)
• Nonsingularity conditions for FB system of reformulating nonlinear second-order cone programming (Q370062) (← links)
• Neural networks for solving second-order cone constrained variational inequality problem (Q429451) (← links)
• A proximal point algorithm for the monotone second-order cone complementarity problem (Q429513) (← links)
• Lagrange multiplier characterizations of robust best approximations under constraint data uncertainty (Q432370) (← links)
• A power penalty method for second-order cone nonlinear complementarity problems (Q492069) (← links)
• Equivalent conditions for Jacobian nonsingularity in linear symmetric cone programming (Q535069) (← 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)
• A continuation approach for the capacitated multi-facility weber problem based on nonlinear SOCP reformulation (Q645558) (← links)
• Generalized Newton's method based on graphical derivatives (Q654072) (← links)
• A smoothed NR neural network for solving nonlinear convex programs with second-order cone constraints (Q726145) (← links)
• The rate of convergence of proximal method of multipliers for second-order cone optimization problems (Q828665) (← links)
• Smoothing inexact Newton method based on a new derivative-free nonmonotone line search for the NCP over circular cones (Q828835) (← links)
• A line search penalty-free method for nonlinear second-order cone programming (Q829562) (← links)
• Clarke generalized Jacobian of the projection onto symmetric cones (Q833023) (← links)
• Differential properties of Euclidean projection onto power cone (Q907372) (← links)
• Interior proximal methods and central paths for convex second-order cone programming (Q992842) (← links)
• A regularized smoothing Newton method for solving SOCCPs based on a new smoothing C-function (Q1644067) (← links)
• Expected residual minimization formulation for a class of stochastic linear second-order cone complementarity problems (Q1681261) (← links)
• A projection neural network for circular cone programming (Q1720929) (← links)
• A power penalty method for second-order cone linear complementarity problems (Q1785626) (← links)
• A semismooth Newton method for nonlinear symmetric cone programming (Q1935944) (← links)
• A sensitivity result for quadratic second-order cone programming and its application. (Q2034051) (← links)
• A prediction-correction inexact alternating direction method for convex nonlinear second-order cone programming with linear constraints (Q2069275) (← links)
• Unified convergence analysis of a second-order method of multipliers for nonlinear conic programming (Q2090426) (← links)
• On iteration complexity of a first-order primal-dual method for nonlinear convex cone programming (Q2136507) (← links)
• An approximate lower order penalty approach for solving second-order cone linear complementarity problems (Q2154446) (← links)
• A new neural network model for solving random interval linear programming problems (Q2181038) (← links)
• Generalized lower-order penalty algorithm for solving second-order cone mixed complementarity problems (Q2222129) (← links)
• On matrix characterizations for \(P\)-property of the linear transformation in second-order cone linear complementarity problems (Q2229461) (← links)
• A homotopy method for nonlinear second-order cone programming (Q2256956) (← links)
• A semismooth Newton method for SOCCPs based on a one-parametric class of SOC complementarity functions (Q2268920) (← links)
• A \({\mathcal {VU}}\)-decomposition method for a second-order cone programming problem (Q2269047) (← links)
• Grasping force optimization for multi-fingered robotic hands using projection and contraction methods (Q2275328) (← links)
• Solution refinement at regular points of conic problems (Q2282811) (← links)
• A new complementarity function and applications in stochastic second-order cone complementarity problems (Q2314060) (← links)
• A new method for solving second-order cone eigenvalue complementarity problems (Q2347575) (← links)
• Monotonicity and circular cone monotonicity associated with circular cones (Q2359137) (← links)
• The second-order cone eigenvalue complementarity problem (Q2811479) (← links)
• Two Classes of Merit Functions for Infinite-Dimensional Second Order Complimentary Problems (Q3590024) (← links)
• S<i>l</i><sub>1</sub>QP Based Algorithm with Trust Region Technique for Solving Nonlinear Second-Order Cone Programming Problems (Q5135248) (← links)
• Quadratic convergence to the optimal solution of second-order conic optimization without strict complementarity (Q5198048) (← links)
• Optimality Conditions for Problems over Symmetric Cones and a Simple Augmented Lagrangian Method (Q5219696) (← links)
• A feasible direction algorithm for nonlinear second-order cone programs (Q5238072) (← links)
• Model Order Reduction Techniques with a Posteriori Error Control for Nonlinear Robust Optimization Governed by Partial Differential Equations (Q5372622) (← links)
• On the generalized Fischer-Burmeister merit function for the second-order cone complementarity problem (Q5401695) (← links)