Applications of second-order cone programming
From MaRDI portal
Publication:1124764
Recommendations
- Second-order cone programming
- Interior point methods for second-order cone programming and OR applications
- SPARSE SECOND ORDER CONE PROGRAMMING FORMULATIONS FOR CONVEX OPTIMIZATION PROBLEMS
- Two-dimensional second-order cone programming
- Second-order cone programming formulations for a class of problems in structural optimization
Cites work
- A Logarithmic Barrier Function Algorithm for Quadratically Constrained Convex Quadratic Programming
- A New Method for Optimal Truss Topology Design
- Acceleration and Parallelization of the Path-Following Interior Point Method for a Linearly Constrained Convex Quadratic Problem
- An \(O(n^ 3L)\) potential reduction algorithm for linear programming
- An Efficient Algorithm for a Bounded Errors-in-Variables Model
- An Efficient Algorithm for Minimizing a Sum of Euclidean Norms with Applications
- An Efficient Newton Barrier Method for Minimizing a Sum of Euclidean Norms
- Associative and Jordan algebras, and polynomial time interior-point algorithms for symmetric cones.
- Computing Limit Loads by Minimizing a Sum of Norms
- Determinant Maximization with Linear Matrix Inequality Constraints
- Equivalent displacement based formulations for maximum strength truss topology design
- Extension of Karmarkar's algorithm onto convex quadratically constrained quadratic problems
- scientific article; zbMATH DE number 3849762 (Why is no real title available?)
- scientific article; zbMATH DE number 53598 (Why is no real title available?)
- scientific article; zbMATH DE number 590363 (Why is no real title available?)
- scientific article; zbMATH DE number 919654 (Why is no real title available?)
- scientific article; zbMATH DE number 3347916 (Why is no real title available?)
- scientific article; zbMATH DE number 964349 (Why is no real title available?)
- Parameter Estimation in the Presence of Bounded Data Uncertainties
- Potential Reduction Polynomial Time Method for Truss Topology Design
- Robust convex optimization
- Robust Solutions to Least-Squares Problems with Uncertain Data
- Robust Solutions to Uncertain Semidefinite Programs
- Self-Scaled Barriers and Interior-Point Methods for Convex Programming
- Semidefinite Programming
- Spherical minimax location problem using the Euclidean norm: Formulation and optimization
- The design of FIR filters in the complex plane by convex optimization
- Two heuristics for the Euclidean Steiner tree problem
Cited in
(only showing first 100 items - show all)- On the coderivative of the projection operator onto the second-order cone
- A multisplitting method for symmetrical affine second-order cone complementarity problem
- Logarithmic regret algorithms for online convex optimization
- Primal-dual interior-point algorithms for second-order cone optimization based on kernel functions
- A one-parametric class of merit functions for the symmetric cone complementarity problem
- Shortest descending paths through given faces
- Growth behavior of two classes of merit functions for symmetric cone complementarity problems
- Compressive sensing for subsurface imaging using ground penetrating radar
- A sequential quadratically constrained quadratic programming method for unconstrained minimax problems
- Sequential quadratically constrained quadratic programming norm-relaxed algorithm of strongly sub-feasible directions
- Optimal design of high-performance separable wavelet filter banks for image coding
- Scaling symmetric positive definite matrices to prescribed row sums.
- Second-order cone programming
- Symbiosis between linear algebra and optimization
- Nonnegative minimum biased quadratic estimation in mixed linear models
- The modulus-based matrix splitting iteration methods for second-order cone linear complementarity problems
- Efficient solutions of interval programming problems with inexact parameters and second order cone constraints
- Primal Newton method for the linear cone programming problem
- Time-dependent green Weber problem
- Jacobian consistency of a one-parametric class of smoothing Fischer-Burmeister functions for SOCCP
- A generalized smoothing Newton method for the symmetric cone complementarity problem
- Global probability maximization for a Gaussian bilateral inequality in polynomial time
- Stochastic second-order-cone complementarity problems: expected residual minimization formulation and its applications
- Minimum spanning trees with neighborhoods: mathematical programming formulations and solution methods
- Extended formulations in mixed integer conic quadratic programming
- Constraint qualification failure in action
- Data-driven robust optimization
- The relaxation modulus-based matrix splitting iteration methods for circular cone nonlinear complementarity problems
- A second-order cone programming formulation for two player zero-sum games with chance constraints
- A projection neural network for circular cone programming
- SOC functions and their applications
- On the quadratic eigenvalue complementarity problem over a general convex cone
- Optimization over structured subsets of positive semidefinite matrices via column generation
- How to project onto extended second order cones
- Second order cone programming approach to two-stage network data envelopment analysis
- Weak disposability in nonparametric production analysis: a new taxonomy of reference technology sets
- Complementarity properties of the Lyapunov transformation over symmetric cones
- A matrix-splitting method for symmetric affine second-order cone complementarity problems
- Uncertain convex programs: randomized solutions and confidence levels
- On self-regular IPMs (with comments and rejoinder)
- A note on treating a second order cone program as a special case of a semidefinite program
- Product-form Cholesky factorization in interior point methods for second-order cone programming
- Conditions for error bounds of linear complementarity problems over second-order cones with pseudomonotonicity
- Robust sample average approximation
- Verifiable sufficient conditions for the error bound property of second-order cone complementarity problems
- A power penalty method for second-order cone linear complementarity problems
- On solving quadratically constrained quadratic programming problem with one non-convex constraint
- Rank-one approximation of positive matrices based on methods of tropical mathematics
- An efficient second-order cone programming approach for optimal selection in tree breeding
- Polyhedral approximation in mixed-integer convex optimization
- Robust ranking and portfolio optimization
- Strong duality and minimal representations for cone optimization
- Generalized locality preserving maxi-min margin machine
- Variable selection of varying coefficient models in quantile regression
- Euclidean minimum spanning trees with independent and dependent geometric uncertainties
- Return-mapping algorithms for associative isotropic hardening plasticity using conic optimization
- Portfolio management with robustness in both prediction and decision: a mixture model based learning approach
- Robust tracking error portfolio selection with worst-case downside risk measures
- A globally and quadratically convergent smoothing Newton method for solving second-order cone optimization
- Sharp upper and lower bounds for maximum likelihood solutions to random Gaussian bilateral inequality systems
- On the coderivative of the solution mapping to a second-order cone constrained parametric variational inequality
- Approximate and exact optimal designs for \(2^k\) factorial experiments for generalized linear models via second order cone programming
- Optimal design for manipulation of random consensus over discrete information in networked systems
- A chance-constrained stochastic model predictive control problem with disturbance feedback
- A sensitivity result for quadratic second-order cone programming and its application.
- A modified LM algorithm for tensor complementarity problems over the circular cone
- A smoothing quasi-Newton method for solving general second-order cone complementarity problems
- Modeling and solving the uncapacitated \(r\)-allocation \(p\)-hub median problem under congestion
- A distributed algorithm for high-dimension convex quadratically constrained quadratic programs
- A feasibility-ensured Lagrangian heuristic for general decomposable problems
- KDE distributionally robust portfolio optimization with higher moment coherent risk
- Improving information reliability of non-radial value efficiency analysis: an additive slacks based measure approach
- Routing for unmanned aerial vehicles: touring dimensional sets
- Dynamic planning of a two-dose vaccination campaign with uncertain supplies
- Convergence of an augmented Lagrange algorithm for nonlinear optimizations with second-order cone constraints
- Global convergence of algorithms under constant rank conditions for nonlinear second-order cone programming
- Minimum cost b-matching problems with neighborhoods
- A combinatorial cut-and-lift procedure with an application to 0-1 second-order conic programming
- The parameter-Newton iteration for the second-order cone linear complementarity problem
- Smoothing functions and algorithm for nonsymmetric circular cone complementarity problems.
- Mixed-integer second-order cone optimization for composite discrete ply-angle and thickness topology optimization problems
- Maximizing products of linear forms, and the permanent of positive semidefinite matrices
- On iteration complexity of a first-order primal-dual method for nonlinear convex cone programming
- Exact algorithms for the 0-1 time-bomb knapsack problem
- Second-order cone programming relaxations for a class of multiobjective convex polynomial problems
- An approximate lower order penalty approach for solving second-order cone linear complementarity problems
- Conic linear programming duals for classes of quadratic semi-infinite programs with applications
- A new neural network model for solving random interval linear programming problems
- SUSPECT: MINLP special structure detector for Pyomo
- Theorems of the alternative for conic integer programming
- Generation of point sets by convex optimization for interpolation in reproducing kernel Hilbert spaces
- Absolute value equations with uncertain data
- DOA estimation of coherent signals based on the sparse representation for acoustic vector-sensor arrays
- Generalized hidden-mapping minimax probability machine for the training and reliability learning of several classical intelligent models
- Optimisation problems as decision problems: the case of fuzzy optimisation problems
- Robust trade-off portfolio selection
- Generalized lower-order penalty algorithm for solving second-order cone mixed complementarity problems
- Extension of the LP-Newton method to conic programming problems via semi-infinite representation
- A pseudo-equilibrium finite element for limit analysis of Reissner-Mindlin plates
- An adversarial optimization approach to efficient outlier removal
This page was built for publication: Applications of second-order cone programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1124764)
