An active-set algorithmic framework for non-convex optimization problems over the simplex (Q782910): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10589-020-00195-x / rank
Normal rank
 
Property / cites work
 
Property / cites work: Projected Newton Methods for Optimization Problems with Simple Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3151174 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large-scale active-set box-constrained optimization method with spectral projected gradients / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3145799 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Evolution towards the maximum clique / rank
 
Normal rank
Property / cites work
 
Property / cites work: A block active set algorithm with spectral choice line search for the symmetric eigenvalue complementarity problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Feasible Active Set Method with Reoptimization for Convex Quadratic Mixed-Integer Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coresets, sparse greedy approximation, and the Frank-Wolfe algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: A two-stage active-set algorithm for bound-constrained optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of optimizing over a simplex, hypercube or sphere: a short survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: An active set feasible method for large-scale minimization problems with bound constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fast Active Set Block Coordinate Descent Algorithm for $\ell_1$-Regularized Least Squares / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Two-Phase Gradient Method for Quadratic Programming Problems with a Single Linear Constraint and Bounds on the Variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3337232 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quadratically and superlinearly convergent algorithms for the solution of inequality constrained minimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Accurate Identification of Active Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Active Set Newton Algorithm for Large-Scale Nonlinear Programs with Box Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some comments on Wolfe's ‘away step’ / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Active Set Algorithm for Box Constrained Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: An active set algorithm for nonlinear optimization with polyhedral constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Projection onto a Polyhedron that Exploits Sparsity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Splitting methods for the Eigenvalue Complementarity Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Linear Convergence of Descent Methods for Convex Essentially Smooth Minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for bound constrained quadratic programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5491447 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterative Solution of Nonlinear Equations in Several Variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4103334 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution methodologies for the smallest enclosing circle problem / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10589-020-00195-X / rank
 
Normal rank

Latest revision as of 03:32, 10 December 2024

scientific article
Language Label Description Also known as
English
An active-set algorithmic framework for non-convex optimization problems over the simplex
scientific article

    Statements

    An active-set algorithmic framework for non-convex optimization problems over the simplex (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    29 July 2020
    0 references
    active-set methods
    0 references
    unit simplex
    0 references
    non-convex optimization
    0 references
    large-scale optimization
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references