The following pages link to Second-order cone programming (Q1411628):
Displaying 50 items.
- Regularization tools and robust optimization for ill-conditioned least squares problem: A computational comparison (Q548361) (← links)
- The penalized Fischer-Burmeister SOC complementarity function (Q548683) (← links)
- A class of polynomial interior-point algorithms for the Cartesian \(P_{*}(\kappa )\) second-order cone linear complementarity problem (Q607084) (← links)
- A generalized Newton method for absolute value equations associated with second order cones (Q609239) (← links)
- A regularization smoothing method for second-order cone complementarity problem (Q611300) (← links)
- On solving the planar \(k\)-centrum problem with Euclidean distances (Q613427) (← links)
- An entropy-like proximal algorithm and the exponential multiplier method for convex symmetric cone programming (Q616787) (← links)
- Existence of a fixed point of a nonsmooth function arising in numerical mechanics (Q618876) (← links)
- The column-sufficiency and row-sufficiency of the linear transformation on Hilbert spaces (Q620526) (← links)
- Implementation of nonsymmetric interior-point methods for linear optimization over sparse matrix cones (Q621748) (← links)
- Constraint consensus methods for finding interior feasible points in second-order cones (Q624763) (← links)
- Solvability of Newton equations in smoothing-type algorithms for the SOCCP (Q629483) (← links)
- Surface fitting and registration of point clouds using approximations of the unsigned distance function (Q631004) (← links)
- A smoothing Newton method with Fischer-Burmeister function for second-order cone complementarity problems (Q639203) (← links)
- The \(Q\) method for symmetric cone programming (Q639204) (← links)
- A continuation approach for the capacitated multi-facility weber problem based on nonlinear SOCP reformulation (Q645558) (← links)
- A smoothing Newton method for second-order cone optimization based on a new smoothing function (Q648325) (← links)
- Enumeration of all wedged equilibrium configurations in contact problem with Coulomb friction (Q649238) (← links)
- Load capacity ratios for structures (Q658709) (← links)
- Semidefinite programming for dynamic steady-state analysis of structures under uncertain harmonic loads (Q660375) (← links)
- A sparse enhanced indexation model with chance and cardinality constraints (Q683716) (← links)
- Improved smoothing Newton methods for symmetric cone complementarity problems (Q691381) (← links)
- A trust region SQP-filter method for nonlinear second-order cone programming (Q692204) (← links)
- Stochastic second-order cone programming: applications models (Q693671) (← links)
- Two-stage robust LP with ellipsoidal right-hand side uncertainty is NP-hard (Q694182) (← links)
- Conic systems and sublinear mappings: equivalent approaches. (Q703260) (← links)
- A smoothing-type Newton method for second-order cone programming problems based on a new smooth function (Q711514) (← links)
- A conic quadratic formulation for a class of convex congestion functions in network flow problems (Q713098) (← links)
- A new one-step smoothing Newton method for second-order cone programming. (Q713481) (← links)
- Computation of sparse low degree interpolating polynomials and their application to derivative-free optimization (Q715240) (← links)
- A smoothed NR neural network for solving nonlinear convex programs with second-order cone constraints (Q726145) (← links)
- Alternative second-order cone programming formulations for support vector classification (Q726156) (← links)
- Quasistatic normal-compliance contact problem of visco-elastic bodies with Coulomb friction implemented by QP and SGBEM (Q729869) (← links)
- A new smoothing Newton-type method for second-order cone programming problems (Q734859) (← links)
- A primal-dual interior-point algorithm for second-order cone optimization with full Nesterov-Todd step (Q734862) (← links)
- Local reduction based SQP-type method for semi-infinite programs with an infinite number of second-order cone constraints (Q740634) (← links)
- Equilibrium problems involving the Lorentz cone (Q742123) (← links)
- Space tensor conic programming (Q742309) (← links)
- First order necessary optimality conditions for mathematical programs with second-order cone complementarity constraints (Q746815) (← links)
- A polynomial-time interior-point method for circular cone programming based on kernel functions (Q747043) (← links)
- Double regularization methods for robust feature selection and SVM classification via DC programming (Q781867) (← links)
- A new model for solving stochastic second-order cone complementarity problem and its convergence analysis (Q824745) (← links)
- Inverse conic linear programs in Banach spaces (Q828644) (← links)
- The rate of convergence of proximal method of multipliers for second-order cone optimization problems (Q828665) (← links)
- A line search penalty-free method for nonlinear second-order cone programming (Q829562) (← links)
- A strong conic quadratic reformulation for machine-job assignment with controllable processing times (Q833574) (← links)
- A damped Gauss-Newton method for the second-order cone complementarity problem (Q836060) (← links)
- A second-order cone cutting surface method: Complexity and application (Q839677) (← links)
- Conic mixed-integer rounding cuts (Q847842) (← links)
- On verified numerical computations in convex programming (Q849186) (← links)
