An augmented Lagrangian proximal alternating method for sparse discrete optimization problems (Q2299205): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Created claim: Wikidata QID (P12): Q127862424, #quickstatements; #temporary_batch_1723839584858
 
(2 intermediate revisions by 2 users not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s11075-019-00705-x / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2945088056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm for cardinality-constrained quadratic optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Exact Solution Approach for Portfolio Optimization Problems Under Stochastic and Integer Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex relaxations and MIQCQP reformulations for a class of cardinality-constrained portfolio selection problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: OPTIMAL LOT SOLUTION TO CARDINALITY CONSTRAINED MEAN–VARIANCE FORMULATION FOR PORTFOLIO SELECTION / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Cardinality Constrained Portfolio Selection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lagrangian relaxation procedure for cardinality-constrained portfolio optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational study of a family of mixed-integer quadratic programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4806224 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perspective reformulations of mixed integer nonlinear programs with indicator variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact augmented Lagrangian duality for mixed integer linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perspective cuts for a class of convex 0-1 mixed integer programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: SDP diagonalizations and perspective cuts for a class of nonseparable MIQP / rank
 
Normal rank
Property / cites work
 
Property / cites work: A computational comparison of reformulations of the perspective relaxation: SOCP vs. cutting planes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite relaxations of fractional programs via novel convexification techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristics for cardinality constrained portfolio optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simulated annealing for complex portfolio selection problems. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization of cardinality constrained portfolios with a hybrid local search algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local search techniques for constrained portfolio selection problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust investment strategies with discrete asset choice constraints using DC programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Successive convex approximations to cardinality-constrained convex programs: a piecewise-linear DC approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical Programs with Cardinality Constraints: Reformulation by Complementarity-Type Conditions and a Regularization Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constraint qualifications and optimality conditions for optimization problems with cardinality constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse Approximation via Penalty Decomposition Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proximal alternating linearized minimization for nonconvex and nonsmooth problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Block Coordinate Descent Method for Regularized Multiconvex Optimization with Applications to Nonnegative Tensor Factorization and Completion / rank
 
Normal rank
Property / cites work
 
Property / cites work: A globally convergent algorithm for nonconvex optimization based on block coordinate update / rank
 
Normal rank
Property / cites work
 
Property / cites work: An augmented Lagrangian approach for sparse principal component analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Augmented Lagrangian Method for Non-Lipschitz Nonconvex Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the convergence of the proximal algorithm for nonsmooth functions involving analytic features / rank
 
Normal rank
Property / cites work
 
Property / cites work: A penalty PALM method for sparse portfolio selection problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Splitting augmented Lagrangian method for optimization problems with a cardinality constraint and semicontinuous variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variational Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizations of Łojasiewicz inequalities: Subgradient flows, talweg, convexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q127862424 / rank
 
Normal rank

Latest revision as of 22:24, 16 August 2024

scientific article
Language Label Description Also known as
English
An augmented Lagrangian proximal alternating method for sparse discrete optimization problems
scientific article

    Statements

    An augmented Lagrangian proximal alternating method for sparse discrete optimization problems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    20 February 2020
    0 references
    0 references
    discrete constrained optimization
    0 references
    \(l_0\) minimization
    0 references
    proximal alternating linearized minimization method
    0 references
    augmented Lagrangian method
    0 references
    sparse projection
    0 references
    0 references
    0 references
    0 references
    0 references