The following pages link to Second-order cone programming (Q1411628):
Displaying 50 items.
- Two-phase simplex method for linear semidefinite optimization (Q2010151) (← links)
- A class of second-order cone eigenvalue complementarity problems for higher-order tensors (Q2014672) (← links)
- Penalized semidefinite programming for quadratically-constrained quadratic optimization (Q2022173) (← links)
- Approximate and exact optimal designs for \(2^k\) factorial experiments for generalized linear models via second order cone programming (Q2029231) (← links)
- Alternate solution approaches for competitive hub location problems (Q2029306) (← links)
- A new measure of technical efficiency in data envelopment analysis based on the maximization of hypervolumes: benchmarking, properties and computational aspects (Q2030523) (← links)
- Russell graph efficiency measures in data envelopment analysis: the multiplicative approach (Q2030620) (← links)
- A sensitivity result for quadratic second-order cone programming and its application. (Q2034051) (← links)
- Linear maps preserving the Lorentz-cone spectrum in certain subspaces of \(M_n\) (Q2042382) (← links)
- A modified LM algorithm for tensor complementarity problems over the circular cone (Q2043190) (← links)
- A dual simplex-type algorithm for the smallest enclosing ball of balls (Q2044498) (← links)
- A smoothing quasi-Newton method for solving general second-order cone complementarity problems (Q2045018) (← links)
- Smoothing Newton method for nonsmooth second-order cone complementarity problems with application to electric power markets (Q2046269) (← links)
- On the Burer-Monteiro method for general semidefinite programs (Q2047215) (← links)
- Modeling and solving the uncapacitated \(r\)-allocation \(p\)-hub median problem under congestion (Q2052283) (← links)
- Penalized kernel quantile regression for varying coefficient models (Q2059422) (← links)
- A prediction-correction inexact alternating direction method for convex nonlinear second-order cone programming with linear constraints (Q2069275) (← links)
- Augmented Lagrangian method for second-order cone programs under second-order sufficiency (Q2070362) (← links)
- Distributionally robust optimization. A review on theory and applications (Q2074636) (← links)
- A smoothing Levenberg-Marquardt method for the complementarity problem over symmetric cone. (Q2076574) (← links)
- Convergence of an augmented Lagrange algorithm for nonlinear optimizations with second-order cone constraints (Q2080934) (← links)
- Global convergence of algorithms under constant rank conditions for nonlinear second-order cone programming (Q2082228) (← links)
- Unified convergence analysis of a second-order method of multipliers for nonlinear conic programming (Q2090426) (← links)
- On approximate solutions for robust semi-infinite multi-objective convex symmetric cone optimization (Q2091085) (← links)
- Scaled constraint qualifications and necessary optimality conditions for nonsmooth mathematical programs with second-order cone complementarity constraints (Q2114848) (← links)
- Naive constant rank-type constraint qualifications for multifold second-order cone programming and semidefinite programming (Q2115314) (← links)
- Scenario reduction revisited: fundamental limits and guarantees (Q2118076) (← links)
- Smoothing functions and algorithm for nonsymmetric circular cone complementarity problems. (Q2128412) (← links)
- On iteration complexity of a first-order primal-dual method for nonlinear convex cone programming (Q2136507) (← links)
- The monotone extended second-order cone and mixed complementarity problems (Q2139262) (← links)
- DC semidefinite programming and cone constrained DC optimization. I: Theory (Q2149953) (← links)
- An approximate lower order penalty approach for solving second-order cone linear complementarity problems (Q2154446) (← links)
- A logarithmic barrier interior-point method based on majorant functions for second-order cone programming (Q2174912) (← links)
- Positive operators on extended second order cones (Q2179853) (← links)
- A new neural network model for solving random interval linear programming problems (Q2181038) (← links)
- Theorems of the alternative for conic integer programming (Q2183216) (← links)
- Generation of point sets by convex optimization for interpolation in reproducing kernel Hilbert spaces (Q2189409) (← links)
- Absolute value equations with uncertain data (Q2191286) (← links)
- A computational study of exact subgraph based SDP bounds for max-cut, stable set and coloring (Q2196300) (← links)
- A new nonmonotone smoothing Newton method for the symmetric cone complementarity problem with the Cartesian \(P_0\)-property (Q2216184) (← links)
- Robust trade-off portfolio selection (Q2218875) (← links)
- Generalized lower-order penalty algorithm for solving second-order cone mixed complementarity problems (Q2222129) (← links)
- A new projected Barzilai-Borwein method for the symmetric cone complementarity problem (Q2227325) (← links)
- On the sensitivity of the optimal partition for parametric second-order conic optimization (Q2230950) (← links)
- A Barzilai and Borwein regularization feasible direction algorithm for convex nonlinear SOC programming with linear constraints (Q2231300) (← links)
- An adversarial optimization approach to efficient outlier removal (Q2251235) (← links)
- On valid inequalities for mixed integer \(p\)-order cone programming (Q2251546) (← links)
- A homotopy method for nonlinear second-order cone programming (Q2256956) (← links)
- Logarithmic barrier decomposition-based interior point methods for stochastic symmetric programming (Q2257767) (← links)
- A semismooth Newton method for SOCCPs based on a one-parametric class of SOC complementarity functions (Q2268920) (← links)
