Recent advances in mathematical programming with semi-continuous variables and cardinality constraint

DOI10.1007/s40305-013-0004-0zbMath1277.90001OpenAlexW2083137236WikidataQ57445433 ScholiaQ57445433MaRDI QIDQ384213

Xiaoling Sun, Li, Duan, Xiao Jin Zheng

Publication date: 27 November 2013

Published in: Journal of the Operations Research Society of China (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40305-013-0004-0

zbMATH Keywords

Lagrangian decompositionperspective reformulationsemi-continuous variablesapproximate methodscardinality and sparsity constraintmixed-integer \(0-1\) quadratic programming

Mathematics Subject Classification ID

Mixed integer programming (90C11) Development of contemporary mathematics (01A65) Boolean programming (90C09) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) History of operations research and mathematical programming (90-03)

Related Items

Sparsity optimization in design of multidimensional filter networks ⋮ Multiperiod mean absolute deviation fuzzy portfolio selection model with risk control and cardinality constraints ⋮ An optimal trade-off model for portfolio selection with sensitivity of parameters ⋮ Convergence of a Scholtes-type regularization method for cardinality-constrained optimization problems with an application in sparse robust portfolio optimization ⋮ Constraint qualifications and optimality conditions for optimization problems with cardinality constraints ⋮ A multiplicative weights update algorithm for MINLP ⋮ A Nonconvex Optimization Approach to IMRT Planning with Dose–Volume Constraints ⋮ On a Reduction for a Class of Resource Allocation Problems ⋮ A new fully polynomial time approximation scheme for the interval subset sum problem ⋮ On a Reformulation of Mathematical Programs with Cardinality Constraints ⋮ On nonsmooth robust multiobjective optimization under generalized convexity with applications to portfolio optimization ⋮ Quadratic Convex Reformulations for Semicontinuous Quadratic Programming ⋮ Complex portfolio selection via convex mixed‐integer quadratic programming: a survey ⋮ Multi-period possibilistic mean semivariance portfolio selection with cardinality constraints and its algorithm ⋮ Sparse convex optimization toolkit: a mixed-integer framework ⋮ Sparse and risk diversification portfolio selection ⋮ Cardinality constrained portfolio selection problem: a completely positive programming approach ⋮ Relaxed method for optimization problems with cardinality constraints ⋮ Distributed primal outer approximation algorithm for sparse convex programming with separable structures ⋮ Portfolio selection with the effect of systematic risk diversification: formulation and accelerated gradient algorithm ⋮ On the weak stationarity conditions for mathematical programs with cardinality constraints: a unified approach ⋮ Valid inequalities for quadratic optimisation with domain constraints ⋮ Time-consistent multiperiod mean semivariance portfolio selection with the real constraints ⋮ Mathematical Programs with Cardinality Constraints: Reformulation by Complementarity-Type Conditions and a Regularization Method ⋮ Sequential optimality conditions for cardinality-constrained optimization problems with applications ⋮ On the structure of linear programs with overlapping cardinality constraints ⋮ Splitting augmented Lagrangian method for optimization problems with a cardinality constraint and semicontinuous variables ⋮ Multiperiod mean absolute deviation uncertain portfolio selection with real constraints ⋮ Relaxation schemes for mathematical programmes with switching constraints

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on the complexity of \(L _{p }\) minimization
• Equivalence of minimal \(\ell _{0}\)- and \(\ell _{p }\)-norm solutions of linear equalities, inequalities and linear programs for sufficiently small \(p\)
• A strong conic quadratic reformulation for machine-job assignment with controllable processing times
• A computational comparison of reformulations of the perspective relaxation: SOCP vs. cutting planes
• Algorithm for cardinality-constrained quadratic optimization
• Portfolio selection using neural networks
• A polyhedral study of the cardinality constrained knapsack problem
• Simulated annealing for complex portfolio selection problems.
• Second-order cone programming
• Optimization of cardinality constrained portfolios with a hybrid local search algorithm
• Heuristics for cardinality constrained portfolio optimization
• Computational study of a family of mixed-integer quadratic programming problems
• Local search techniques for constrained portfolio selection problems
• Convex relaxations and MIQCQP reformulations for a class of cardinality-constrained portfolio selection problems
• A polynomial case of the cardinality-constrained quadratic optimization problem
• A polyhedral study of the semi-continuous knapsack problem
• Perspective cuts for a class of convex 0-1 mixed integer programs
• Perspective reformulations of mixed integer nonlinear programs with indicator variables
• SDP diagonalizations and perspective cuts for a class of nonseparable MIQP
• Lectures on Modern Convex Optimization
• Optimal Cardinality Constrained Portfolio Selection
• Projected Perspective Reformulations with Applications in Design Problems
• An Unconstrained $\ell_q$ Minimization with $0q\leq1$ for Sparse Solution of Underdetermined Linear Systems
• Lower Bound Theory of Nonzero Entries in Solutions of $\ell_2$-$\ell_p$ Minimization
• An Exact Solution Approach for Portfolio Optimization Problems Under Stochastic and Integer Constraints
• Lagrangian relaxation procedure for cardinality-constrained portfolio optimization
• From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
• The Optimal Selection of Small Portfolios
• Minimum-support solutions of polyhedral concave programs^*
• Uncertainty principles and ideal atomic decomposition
• Reweighted $\ell_1$-Minimization for Sparse Solutions to Underdetermined Linear Systems
• Exact and Approximate Sparse Solutions of Underdetermined Linear Equations
• Cardinality Constrained Linear-Quadratic Optimal Control
• OPTIMAL LOT SOLUTION TO CARDINALITY CONSTRAINED MEAN–VARIANCE FORMULATION FOR PORTFOLIO SELECTION
• Semidefinite relaxations of fractional programs via novel convexification techniques