Lagrangian relaxation procedure for cardinality-constrained portfolio optimization
From MaRDI portal
(Redirected from Publication:3514845)
Recommendations
- Optimal cardinality constrained portfolio selection
- Convex relaxations and MIQCQP reformulations for a class of cardinality-constrained portfolio selection problems
- A local relaxation method for the cardinality constrained portfolio optimization problem
- A discrete multi-factor portfolio optimization model with cardinality constraints
- Algorithm for cardinality-constrained quadratic optimization
Cited in
(55)- Time-consistent multiperiod mean semivariance portfolio selection with the real constraints
- Computing cardinality constrained portfolio selection efficient frontiers via closest correlation matrices
- A penalty PALM method for sparse portfolio selection problems
- Improving the performance of MIQP solvers for quadratic programs with cardinality and minimum threshold constraints: a semidefinite program approach
- Norm constrained minimum variance portfolios with short selling
- A cardinality constrained stochastic goal programming model with satisfaction functions for venture capital investment decision making
- Equity portfolio management with cardinality constraints and risk parity control using multi-objective particle swarm optimization
- Equally weighted cardinality constrained portfolio selection via factor models
- The complexity results of the sparse optimization problems and reverse convex optimization problems
- A unifying framework for sparsity-constrained optimization
- Multiperiod mean absolute deviation fuzzy portfolio selection model with risk control and cardinality constraints
- On the application of an augmented Lagrangian algorithm to some portfolio problems
- Artificial bee colony algorithm for constrained possibilistic portfolio optimization problem
- Recent advances in mathematical programming with semi-continuous variables and cardinality constraint
- Multi-period mean-variance portfolio optimization with capital injections
- Cardinality minimization, constraints, and regularization: a survey
- Techniques for accelerating branch-and-bound algorithms dedicated to sparse optimization
- A Fuzzy Goal Programming Model for Venture Capital Investment Decision Making
- Global optimization for sparse solution of least squares problems
- Fast algorithms for sparse portfolio selection considering industries and investment styles
- A multiplicative weights update algorithm for MINLP
- An inexact proximal DC algorithm for the large-scale cardinality constrained mean-variance model in sparse portfolio selection
- Minimizing the tracking error of cardinality constrained portfolios
- Convergence of a Scholtes-type regularization method for cardinality-constrained optimization problems with an application in sparse robust portfolio optimization
- An efficient Lagrange-Newton algorithm for long-only cardinality constrained portfolio selection on real data sets
- A polynomial case of the cardinality-constrained quadratic optimization problem
- An augmented Lagrangian proximal alternating method for sparse discrete optimization problems
- Projected gradient descent method for cardinality-constrained portfolio optimization
- Solving cardinality constrained mean-variance portfolio problems via MILP
- Complex portfolio selection via convex mixed‐integer quadratic programming: a survey
- A new algorithm for quadratic integer programming problems with cardinality constraint
- Incorporating environmental and social considerations into the portfolio optimization process
- Optimal cardinality constrained portfolio selection
- Cardinality-constrained portfolio optimization with short selling and risk-neutral interest rate
- Sparse tangent portfolio selection via semi-definite relaxation
- Multiperiod mean absolute deviation uncertain portfolio selection with real constraints
- Convex relaxations and MIQCQP reformulations for a class of cardinality-constrained portfolio selection problems
- Robust CCMV model with short selling and risk-neutral interest rate
- A local relaxation method for the cardinality constrained portfolio optimization problem
- Multi-period possibilistic mean semivariance portfolio selection with cardinality constraints and its algorithm
- Cardinality constrained portfolio selection problem: a completely positive programming approach
- Tight upper bounds on the cardinality constrained mean-variance portfolio optimization problem using truncated eigendecomposition
- An exact algorithm for a cardinality-constrained index tracking model considering investment preferences in portfolio optimization
- Heuristic algorithms for the cardinality constrained efficient frontier
- A new method for mean-variance portfolio optimization with cardinality constraints
- Successive convex approximations to cardinality-constrained convex programs: a piecewise-linear DC approach
- Quadratic convex reformulations for semicontinuous quadratic programming
- Cardinality-constrained risk parity portfolios
- Linear vs. quadratic portfolio selection models with hard real-world constraints
- A new efficiently encoded multiobjective algorithm for the solution of the cardinality constrained portfolio optimization problem
- Exact solution methods for the k-item quadratic knapsack problem
- An iterative method for solving a bi-objective constrained portfolio optimization problem
- A sparsity-driven solution method for the cardinality constrained mean-variance portfolio selection problem
- Portfolio selection problems with Markowitz's mean-variance framework: a review of literature
- On a Reformulation of Mathematical Programs with Cardinality Constraints
This page was built for publication: Lagrangian relaxation procedure for cardinality-constrained portfolio optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3514845)
