Applications of second-order cone programming

From MaRDI portal

Publication:1124764

Jump to:navigation, search

DOI10.1016/S0024-3795(98)10032-0zbMath0946.90050WikidataQ114850253 ScholiaQ114850253MaRDI QIDQ1124764

Miguel Sousa Lobo, Lieven Vandenberghe, Hervé Lebret, Stephen P. Boyd

Publication date: 28 November 1999

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

zbMATH Keywords

quadratic programming convex optimization semidefinite programming interior-point methods

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Quadratic programming (90C20) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Interior-point methods (90C51)

Related Items

Cutting-planes for weakly-coupled 0/1 second order cone programs, Asymptotic Analysis for a Stochastic Second-Order Cone Programming and Applications, Support vector machine classification with noisy data: a second order cone programming approach, A unified mathematical programming formulation of strain driven and interior point algorithms for shakedown and limit analysis, A New Iteration Large-Update Primal-Dual Interior-Point Method for Second-Order Cone Programming, Multiobjective Optimization via Parametric Optimization: Models, Algorithms, and Applications, A full-step interior-point algorithm for second-order cone optimization based on a simple locally kernel function, Convexification of Queueing Formulas by Mixed-Integer Second-Order Cone Programming: An Application to a Discrete Location Problem with Congestion, Finding a Hausdorff Core of a Polygon: On Convex Polygon Containment with Bounded Hausdorff Distance, Network-related problems in optimal experimental design and second order cone programming, Efficient solution of second order cone program for model predictive control, Extended Formulations in Mixed-Integer Convex Programming, On Radius of Robust Feasibility for Convex Conic Programs with Data Uncertainty, Second-order cone programming approaches to static shakedown analysis in steel plasticity, Statistical Inference of Second-Order Cone Programming, Unnamed Item, A smoothing stochastic gradient method for composite optimization, Aircraft Rescheduling with Cruise Speed Control, Robust Optimization for Models with Uncertain Second-Order Cone and Semidefinite Programming Constraints, A method combining norm-relaxed QCQP subproblems with active set identification for inequality constrained optimization, Ellipsoidal Relaxations of the Stable Set Problem: Theory and Algorithms, One-bit gridless DOA estimation with multiple measurements exploiting accelerated proximal gradient algorithm, Facility location problems on graphs with non-convex neighborhoods, On Surrogate Duality and Competition between Entropy and Potential Energy in the Finite Element Model of Elastic Contact Mechanics, Constrained multi‐location assortment optimization under the multinomial logit model, An SOCP approach to a two-stage network DEA with feedbacks and shared resources, Complex portfolio selection via convex mixed‐integer quadratic programming: a survey, A route generation algorithm for an optimal fuel routing problem between two single ports, A corrector–predictor path-following method for second-order cone optimization, Unnamed Item, A Branch-and-Bound Algorithm for the Close-Enough Traveling Salesman Problem, OptimalA PrioriBalance in the Design of Controlled Experiments, Unnamed Item, Discrete Approximations to Continuum Optimal Flow Problems, Sum of squares basis pursuit with linear and second order cone programming, Empirical Approach for Optimal Reinsurance Design, On approximatingD-induced polar sets of geometric and extended geometric cones, On approximating D-induced polar sets of a second-order cone by an ellipsoid, DSOS and SDSOS Optimization: More Tractable Alternatives to Sum of Squares and Semidefinite Optimization, S<i>l</i><sub>1</sub>QP Based Algorithm with Trust Region Technique for Solving Nonlinear Second-Order Cone Programming Problems, Portfolio Optimization with Nonparametric Value at Risk: A Block Coordinate Descent Method, A guide to conic optimisation and its applications, Smoothing Homotopy Method for Solving Second-Order Cone Complementarity Problem, An extension of Chubanov's polynomial-time linear programming algorithm to second-order cone programming, The solution of euclidean norm trust region SQP subproblems via second-order cone programs: an overview and elementary introduction, On the generalized Fischer-Burmeister merit function for the second-order cone complementarity problem, Primal interior-point decomposition algorithms for two-stage stochastic extended second-order cone programming, Second-Order Cone Programming (SOCP) Techniques for Coordinating Large-Scale Robot Teams in Polygonal Environments, Robust portfolio asset allocation and risk measures, Second Order Cone Programming Relaxation of a Positive Semidefinite Constraint, An iteration primal–dual path-following method, based on wide neighbourhood and large update, for second-order cone programming, Control of linear systems subject to input constraints: A polynomial approach., JuMP: A Modeling Language for Mathematical Optimization, Smoothing and Regularization for Mixed-Integer Second-Order Cone Programming with Applications in Portfolio Optimization, Robust portfolio asset allocation and risk measures, Shape-preserving, multiscale interpolation by bi- and multivariate cubic \(L_{1}\) splines, Static and dynamic VaR constrained portfolios with application to delegated portfolio management, Implementation of interior point methods for mixed semidefinite and second order cone optimization problems, Graph Implementations for Nonsmooth Convex Programs, Second-Order Cone Programming Formulations for Robust Multiclass Classification, Robust support vector machines for classification and computational issues, LTV models in MPC for sustainable development, Quadratic convergence to the optimal solution of second-order conic optimization without strict complementarity, Optimal Risk Transfer: A Numerical Optimization Approach, Proximal Distance Algorithms: Theory and Examples, A linearly convergent derivative-free descent method for the second-order cone complementarity problem, Robust convex conic optimization in D-induced duality framework, Approximate minimum enclosing balls in high dimensions using core-sets, Variational Methods for Denoising Matrix Fields, Technical Note—A Conic Integer Optimization Approach to the Constrained Assortment Problem Under the Mixed Multinomial Logit Model, The Mothership and Drone Routing Problem, Successive Quadratic Upper-Bounding for Discrete Mean-Risk Minimization and Network Interdiction, Non-Convex Global Minimization and False Discovery Rate Control for the TREX, Semidefinite and second-order cone optimization approach for the Toeplitz matrix approximation problem, A pivoting procedure for a class of second-order cone programming, Robust optimization with applications to game theory, Simplex-type algorithm for second-order cone programmes via semi-infinite programming reformulation, Limit analysis of plates using the EFG method and second-order cone programming, Computationally Tractable Counterparts of Distributionally Robust Constraints on Risk Measures, A non-interior continuation method for second-order cone programming, Introducing Nonpolyhedral Cones to Multiobjective Programming, Robust portfolio selection under downside risk measures, A convex relaxation for the time-optimal trajectory planning of robotic manipulators along predetermined geometric paths, Further relationship between second-order cone and positive semidefinite matrix cone, A nonmonotone smoothing Newton method for circular cone programming, A feasible direction algorithm for nonlinear second-order cone programs, Supporting locomotive functions of a six-legged walking robot, A Krylov Subspace Method for Large-Scale Second-Order Cone Linear Complementarity Problem, An Inexact Augmented Lagrangian Method for Second-Order Cone Programming with Applications, Cutting plane algorithms for robust conic convex optimization problems, The convex and monotone functions associated with second-order cone, Support vector regression with noisy data: a second order cone programming approach, A new outlier detection method based on convex optimization: application to diagnosis of Parkinson’s disease, A convergence analysis of the scaling-invariant primal-dual path-following algorithms for second-order cone programming, An Exact Algorithm for Minimizing a Sum of Euclidean Norms on Rays in 2D and 3D, On Optimality Conditions for Nonlinear Conic Programming, Power-constrained intermittent control, Optimality Conditions in Semidefinite Programming, On sequential approximate simultaneous analysis and design in classical topology optimization, An efficient cutting plane algorithm for the smallest enclosing circle problem, Some P-properties of the quadratic representations and automorphism invariance in Euclidean Jordan algebras, Omega-CVaR portfolio optimization and its worst case analysis, On distributionally robust chance-constrained linear programs, Ellipsoidal support vector clustering for functional MRI analysis, A sensitive-eigenvector based global algorithm for quadratically constrained quadratic programming, Quadratically constraint quadratical algorithm model for nonlinear minimax problems, A predictor-corrector smoothing method for second-order cone programming, Two unconstrained optimization approaches for the Euclidean \(\kappa \)-centrum location problem, Structured large margin machines: sensitive to data distributions, A Newton's method for perturbed second-order cone programs, Modelling and optimisation for sustainable development policy assessment, Computation algorithm for convex semi-infinite program with second-order cones: special analyses for affine and quadratic case, The matrix splitting iteration method for nonlinear complementarity problems associated with second-order cone, On the circumcentered-reflection method for the convex feasibility problem, Distributionally robust fault detection design and assessment for dynamical systems, Hadamard directional differentiability of the optimal value of a linear second-order conic programming problem, Enhanced trajectory tracking using optimally combined feedforward plant inversion and feedforward closed loop inversion, On subspace properties of the quadratically constrained quadratic program, A multiplicative weight updates algorithm for packing and covering semi-infinite linear programs, Minimum energy configurations on a toric lattice as a quadratic assignment problem, Sparse wavelet estimation in quantile regression with multiple functional predictors, Anderson accelerating the preconditioned modulus approach for linear complementarity problems on second-order cones, Ordered \(p\)-median problems with neighbourhoods, Optimal robust insurance with a finite uncertainty set, The dual simplex-type method for linear second-order cone programming problem, A variant of the affine-scaling method for a second-order cone program, Generalized hidden-mapping minimax probability machine for the training and reliability learning of several classical intelligent models, On vector and matrix median computation, Optimisation problems as decision problems: the case of fuzzy optimisation problems, Worst-case violation of sampled convex programs for optimization with uncertainty, Hidden conic quadratic representation of some nonconvex quadratic optimization problems, Second order optimality conditions and reformulations for nonconvex quadratically constrained quadratic programming problems, Linear complementarity problems over symmetric cones: characterization of \(Q _{b }\)-transformations and existence results, On families of quadratic surfaces having fixed intersections with two hyperplanes, 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, Robust envelope-constrained filter with orthonormal bases and semi-definite and semi-infinite programming, An SQP-type algorithm for nonlinear second-order cone programs, Generalized filtering algorithms for infeasibility analysis, Recovering risk-neutral probability density functions from options prices using cubic splines and ensuring nonnegativity, On two-stage convex chance constrained problems, Necessary conditions and duality for inexact nonlinear semi-infinite programming problems, A pseudo-equilibrium finite element for limit analysis of Reissner-Mindlin plates, Second-order cone and semidefinite representations of material failure criteria, Robust multiclass kernel-based classifiers, An adversarial optimization approach to efficient outlier removal, Squaring the circle: an algorithm for generating polyhedral invariant sets from ellipsoidal ones, Primal-dual interior-point algorithms for second-order cone optimization based on a new parametric kernel function, A descent method for a reformulation of the second-order cone complementarity problem, On local convergence of sequential quadratically-constrained quadratic-programming type methods, with an extension to variational problems, Portfolio optimization with linear and fixed transaction costs, Box-constrained minimization reformulations of complementarity problems in second-order cones, Conditions for error bounds and bounded level sets of some merit functions for the second-order cone complementarity problem, Robust SOS-convex polynomial optimization problems: exact SDP relaxations, Robust profit opportunities in risky financial portfolios, Embedded feature-selection support vector machine for driving pattern recognition, A semismooth Newton method for SOCCPs based on a one-parametric class of SOC complementarity functions, Robust classification and regression using support vector machines, An inexact modified Newton method for VISCC and application in grasping force, Grasping force optimization for multi-fingered robotic hands using projection and contraction methods, Simplex QP-based methods for minimizing a conic quadratic objective over polyhedra, A New Infeasible Interior-Point Method Based on a Non-Coercive Kernel Function with Improved Centering Steps for Second-Order Cone Optimization, A new method for classifying random variables based on support vector machine, The convergence of a modified smoothing-type algorithm for the symmetric cone complementarity problem, Semidefinite programming relaxations and algebraic optimization in control, Robust control of identified models with mixed parametric and non-parametric uncertainties, A one-parametric class of smoothing functions for second-order cone programming, Worst-case robust Omega ratio, An Introduction to Formally Real Jordan Algebras and Their Applications in Optimization, An exact decomposition algorithm for a chance-constrained new product risk model, Minimal conic quadratic reformulations and an optimization model, A smoothing-type algorithm for the second-order cone complementarity problem with a new nonmonotone line search, Lower level duality and the global solution of generalized semi-infinite programs, Solution methods for a min-max facility location problem with regional customers considering closest Euclidean distances, The decompositions with respect to two core non-symmetric cones, A minisum location problem with regional demand considering farthest Euclidean distances, A large-update primal–dual interior-point algorithm for second-order cone optimization based on a new proximity function, Solution analysis for the pseudomonotone second-order cone linear complementarity problem, Interior proximal bundle algorithm with variable metric for nonsmooth convex symmetric cone programming, Advances in the simulation of viscoplastic fluid flows using interior-point methods, An efficient numerical method for the symmetric positive definite second-order cone linear complementarity problem, Characterizations of mixed binary convex quadratic representable sets, The Jacobian consistency of a one-parametric class of smoothing functions for SOCCP, A hybrid algorithm for the two-trust-region subproblem, New constraint qualifications and optimality conditions for second order cone programs, Multi-facility green Weber problem, Cuts for mixed 0-1 conic programming, Sparse signal recovery for direction-of-arrival estimation based on source signal subspace, Constrained linear MPC with time-varying terminal cost using convex combinations, An unconstrained smooth minimization reformulation of the second-order cone complementarity problem, A \(\mathcal{VU}\)-algorithm for convex minimization, Proximal operator of quotient functions with application to a feasibility problem in query optimization, Analysis of smoothing-type algorithms for the convex second-order cone programming, A new method for solving second-order cone eigenvalue complementarity problems, Approximate cone factorizations and lifts of polytopes, Second order sufficient conditions for a class of bilevel programs with lower level second-order cone programming problem, A smoothing Newton method for symmetric cone complementarity problem, Active allocation of systematic risk and control of risk sensitivity in portfolio optimization, Variational inequality formulation of circular cone eigenvalue complementarity problems, Integrated inventory control and facility location decisions in a multi-echelon supply chain network with hubs, Large-scale optimization with the primal-dual column generation method, Solvability based on E-property for the nonlinear symmetric cone complementarity problem, An inexact smoothing method for SOCCPs based on a one-parametric class of smoothing function, Relaxation methods for navigation satellites set optimization, The rate of convergence of proximal method of multipliers for second-order cone optimization problems, A line search penalty-free method for nonlinear second-order cone programming, Improved algorithms for online load balancing, The algebraic structure of the arbitrary-order cone, Tractable approximate robust geometric programming, A damped Gauss-Newton method for the second-order cone complementarity problem, CBLIB 2014: a benchmark library for conic mixed-integer and continuous optimization, Decomposition-based interior point methods for stochastic quadratic second-order cone programming, Conic optimization via operator splitting and homogeneous self-dual embedding, The use of squared slack variables in nonlinear second-order cone programming, Uplink scheduling for joint wireless orthogonal frequency and time division multiple access networks, Conic mixed-integer rounding cuts, Mixed integer second-order cone programming formulations for variable selection in linear regression, Second order conic approximation for disassembly line design with joint probabilistic constraints, Continuous multifacility ordered median location problems, A smoothing Newton-type algorithm of stronger convergence for the quadratically constrained convex quadratic programming, A practical nonlinear dynamic framework for solving a class of fractional programming problems, Stochastic graph partitioning: quadratic versus SOCP formulations, Optimization over state feedback policies for robust control with constraints, An alternating direction method for second-order conic programming, Generating cutting planes for the semidefinite relaxation of quadratic programs, Two classes of merit functions for the second-order cone complementarity problem, Heuristics for a continuous multi-facility location problem with demand regions, Stochastic MPC with inequality stability constraints, A semi-smooth Newton method for projection equations and linear complementarity problems with respect to the second order cone, SDP reformulation for robust optimization problems based on nonconvex QP duality, A statistical minimax approach to optimizing linear models under a priori uncertainty conditions, Computational strategy for Russell measure in DEA: second-order cone programming, A compressed primal-dual method for generating bivariate cubic \(L_{1}\) splines, A two-parametric class of merit functions for the second-order cone complementarity problem, A polynomial-time solution scheme for quadratic stochastic programs, Optimization under uncertainty with applications to design of truss structures, A full Nesterov-Todd step infeasible interior-point method for second-order cone optimization, A class of polynomial interior-point algorithms for the Cartesian \(P_{*}(\kappa )\) second-order cone linear complementarity problem, Second-order cone programming formulations for a class of problems in structural optimization, Optimal design and verification of temporal and spatial filters using second-order cone programming approach, Computing exact \(D\)-optimal designs by mixed integer second-order cone programming, An entropy-like proximal algorithm and the exponential multiplier method for convex symmetric cone programming, Lifting for conic mixed-integer programming, Constraint consensus methods for finding interior feasible points in second-order cones, Computing optimal designs of multiresponse experiments reduces to second-order cone program\-ming, Surface fitting and registration of point clouds using approximations of the unsigned distance function, A proximal point algorithm for the monotone second-order cone complementarity problem, Differential properties of Euclidean projection onto power cone, Interior point methods 25 years later, On two-stage stochastic knapsack problems, Round-off estimates for second-order conic feasibility problems, Estimation of risk-neutral density surfaces, A continuation approach for the capacitated multi-facility weber problem based on nonlinear SOCP reformulation, A smoothing Newton method for second-order cone optimization based on a new smoothing function, The augmented Lagrangian method for a type of inverse quadratic programming problems over second-order cones, Ultra-wide band microwave image reconstruction for early breast cancer detection by norm constrained capon beamforming, The solution set structure of monotone linear complementarity problems over second-order cone, Homogeneous self-dual algorithms for stochastic second-order cone programming, A working set SQCQP algorithm with simple nonmonotone penalty parameters, Complete characterizations of stable Farkas' lemma and cone-convex programming duality, Load capacity ratios for structures, Smoothing Newton algorithm for the second-order cone programming with a nonmonotone line search, Model decomposition and reduction tools for large-scale networks in systems biology, Truss topology optimization with discrete design variables by outer approximation, Proximal-like algorithm using the quasi D-function for convex second-order cone programming, Analysis of a non-monotone smoothing-type algorithm for the second-order cone programming., A sequential quadratically constrained quadratic programming method with an augmented Lagrangian line search function, A power penalty method for second-order cone nonlinear complementarity problems, A quadratically approximate framework for constrained optimization, global and local convergence, Conversion of some classes of fractional programming to second-order cone programming and solving it by potential reduction interior point method, Restoration of matrix fields by second-order cone programming, Relative entropy optimization and its applications, Sub-quadratic convergence of a smoothing Newton method for second-order cone programming, Analysis of a non-interior continuation method for second-order cone programming, An improved algorithm for computing Steiner minimal trees in Euclidean \(d\)-space, An eigenvalue decomposition based branch-and-bound algorithm for nonconvex quadratic programming problems with convex quadratic constraints, A one-step smoothing Newton method for second-order cone programming, Exact formulas for the proximal/regular/limiting normal cone of the second-order cone complementarity set, Weak infeasibility in second order cone programming, Improved smoothing Newton methods for symmetric cone complementarity problems, A trust region SQP-filter method for nonlinear second-order cone programming, Robust portfolio optimization with derivative insurance guarantees, Stochastic second-order cone programming: applications models, Two-stage robust LP with ellipsoidal right-hand side uncertainty is NP-hard, Two new predictor-corrector algorithms for second-order cone programming, A nonsmooth algorithm for cone-constrained eigenvalue problems, A smoothing Newton method based on a one-parametric class of smoothing function for SOCCP, Conic formulation for \(l_p\)-norm optimization, The penalized Fischer-Burmeister SOC complementarity function, Reflection-projection method for convex feasibility problems with an obtuse cone, A smoothing-type Newton method for second-order cone programming problems based on a new smooth function, A new one-step smoothing Newton method for second-order cone programming., A new smoothing Newton-type method for second-order cone programming problems, A primal-dual interior-point algorithm for second-order cone optimization with full Nesterov-Todd step, Local reduction based SQP-type method for semi-infinite programs with an infinite number of second-order cone constraints, Space tensor conic programming, Generalization bounds for learning with linear, polygonal, quadratic and conic side knowledge, A new approach to the weighted peak-constrained least-square error FIR digital filter optimal design problem, 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, The modulus-based matrix splitting iteration methods for second-order cone linear complementarity 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, Efficient solutions of interval programming problems with inexact parameters and second order cone constraints, Exact algorithms for the 0-1 time-bomb knapsack problem, Primal Newton method for the linear cone programming 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, Time-dependent green Weber problem, Conic linear programming duals for classes of quadratic semi-infinite programs with applications, 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, A new neural network model for solving random interval linear programming problems, Robust ranking and portfolio optimization, Stochastic second-order-cone complementarity problems: expected residual minimization formulation and its applications, SUSPECT: MINLP special structure detector for Pyomo, Strong duality and minimal representations for cone optimization, Theorems of the alternative for conic integer programming, Minimum spanning trees with neighborhoods: mathematical programming formulations and solution methods, Generation of point sets by convex optimization for interpolation in reproducing kernel Hilbert spaces, Extended formulations in mixed integer conic quadratic programming, Absolute value equations with uncertain data, DOA estimation of coherent signals based on the sparse representation for acoustic vector-sensor arrays, Constraint qualification failure in action, Generalized locality preserving maxi-min margin machine, Scaling symmetric positive definite matrices to prescribed row sums., Data-driven robust optimization, Variable selection of varying coefficient models in quantile regression, 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, On the quadratic eigenvalue complementarity problem over a general convex cone, 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, Optimization over structured subsets of positive semidefinite matrices via column generation, Robust tracking error portfolio selection with worst-case downside risk measures, 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, Largest dual ellipsoids inscribed in dual cones, Complementarity properties of the Lyapunov transformation over symmetric cones, A one-parametric class of merit functions for the second-order cone complementarity problem, Approximation related to quotient functionals, A matrix-splitting method for symmetric affine second-order cone complementarity problems, 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, Uncertain convex programs: randomized solutions and confidence levels, On self-regular IPMs (with comments and rejoinder), Inexact Josephy-Newton framework for generalized equations and its applications to local analysis of Newtonian methods for constrained optimization, Optimal experiment design in a filtering context with application to sampled network data, A note on treating a second order cone program as a special case of a semidefinite program, On the coderivative of the solution mapping to a second-order cone constrained parametric variational inequality, Product-form Cholesky factorization in interior point methods for second-order cone programming, A convex optimization approach to filtering in jump linear systems with state dependent transitions, 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, Approximate and exact optimal designs for \(2^k\) factorial experiments for generalized linear models via second order cone programming, Interior proximal methods and central paths for convex second-order cone programming, A globally convergent non-interior point algorithm with full Newton step for second-order cone programming, Upper bounds for the 0-1 stochastic knapsack problem and a B\&B algorithm, Optimal design for manipulation of random consensus over discrete information in networked systems, A chance-constrained stochastic model predictive control problem with disturbance feedback, On solving quadratically constrained quadratic programming problem with one non-convex constraint, A sensitivity result for quadratic second-order cone programming and its application., Rank-one approximation of positive matrices based on methods of tropical mathematics, On the coderivative of the projection operator onto the second-order cone, An efficient second-order cone programming approach for optimal selection in tree breeding, A multisplitting method for symmetrical affine second-order cone complementarity problem, Polyhedral approximation in mixed-integer convex optimization, 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, Logarithmic regret algorithms for online convex optimization, Primal-dual interior-point algorithms for second-order cone optimization based on kernel functions, Modeling and solving the uncapacitated \(r\)-allocation \(p\)-hub median problem under congestion, A one-parametric class of merit functions for the symmetric cone complementarity problem, A distributed algorithm for high-dimension convex quadratically constrained quadratic programs, Shortest descending paths through given faces, Growth behavior of two classes of merit functions for symmetric cone complementarity problems, A feasibility-ensured Lagrangian heuristic for general decomposable problems, Compressive sensing for subsurface imaging using ground penetrating radar, 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, A sequential quadratically constrained quadratic programming method for unconstrained minimax problems, 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, Sequential quadratically constrained quadratic programming norm-relaxed algorithm of strongly sub-feasible directions, Global convergence of algorithms under constant rank conditions for nonlinear second-order cone programming, Minimum cost \(b\)-matching problems with neighborhoods, Optimal design of high-performance separable wavelet filter banks for image coding, Symbiosis between linear algebra and optimization, A combinatorial cut-and-lift procedure with an application to 0-1 second-order conic programming, Nonnegative minimum biased quadratic estimation in mixed linear models, Variational analysis of norm cones in finite dimensional Euclidean spaces, An inventory hub location model for multi‐coal‐fired coastal power plants: a case study in Guangdong district, Systemic risk of optioned portfolio: controllability and optimization, On the weak second-order optimality condition for nonlinear semidefinite and second-order cone programming, Outcome-space branch-and-bound outer approximation algorithm for a class of non-convex quadratic programming problems, Conic relaxations with stable exactness conditions for parametric robust convex polynomial problems, Moving from linear to conic markets for electricity, Conic optimization: a survey with special focus on copositive optimization and binary quadratic problems, On the centralization of the circumcentered-reflection method, A new bound for Erdős’ minimum overlap problem, Sparse basis pursuit for compliance minimization in the vanishing volume ratio limit, Algebraic and geometric properties of \(\mathcal{L}_+^n\)-semipositive matrices and \(\mathcal{L}_+^n\)-semipositive cones, Supermodularity and valid inequalities for quadratic optimization with indicators, Hadamard product and related inequalities in the Jordan spin algebra, Pseudomonotonicity of nonlinear transformations on Euclidean Jordan algebras, Optimality conditions for nonlinear second-order cone programming and symmetric cone programming, Reducing the projection onto the monotone extended second-order cone to the pool-adjacent-violators algorithm of isotonic regression, On semidefinite programming relaxations for a class of robust SOS-convex polynomial optimization problems, Semipositivity with respect to the Lorentz cone, Quantum theory in finite dimension cannot explain every general process with finite memory

Uses Software

Cites Work

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1124764&oldid=13169209"