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

From MaRDI portal

Jump to:navigation, search

scientific article

In more languages

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

Statements

scholarly article

An active-set algorithmic framework for non-convex optimization problems over the simplex (English)

Andrea Cristofari

Marianna De Santis

Francesco Rinaldi

Computational Optimization and Applications

publication date

29 July 2020

full work available at URL

https://arxiv.org/abs/1703.07761

zbMATH Keywords

active-set methods

unit simplex

non-convex optimization

large-scale optimization

describes a project that uses

MaRDI profile type

MaRDI publication profile

Projected Newton Methods for Optimization Problems with Simple Constraints

Large-scale active-set box-constrained optimization method with spectral projected gradients

Evolution towards the maximum clique

A block active set algorithm with spectral choice line search for the symmetric eigenvalue complementarity problem

A Feasible Active Set Method with Reoptimization for Convex Quadratic Mixed-Integer Programming

Coresets, sparse greedy approximation, and the Frank-Wolfe algorithm

A two-stage active-set algorithm for bound-constrained optimization

The complexity of optimizing over a simplex, hypercube or sphere: a short survey

An active set feasible method for large-scale minimization problems with bound constraints

A Fast Active Set Block Coordinate Descent Algorithm for $\ell_1$-Regularized Least Squares

A Two-Phase Gradient Method for Quadratic Programming Problems with a Single Linear Constraint and Bounds on the Variables

Quadratically and superlinearly convergent algorithms for the solution of inequality constrained minimization problems

On the Accurate Identification of Active Constraints

An Active Set Newton Algorithm for Large-Scale Nonlinear Programs with Box Constraints

Some comments on Wolfe's ‘away step’

A New Active Set Algorithm for Box Constrained Optimization

An active set algorithm for nonlinear optimization with polyhedral constraints

Projection onto a Polyhedron that Exploits Sparsity

Splitting methods for the Eigenvalue Complementarity Problem

On the Linear Convergence of Descent Methods for Convex Essentially Smooth Minimization

Algorithms for bound constrained quadratic programming problems

Iterative Solution of Nonlinear Equations in Several Variables

Solution methodologies for the smallest enclosing circle problem

Identifiers

Sitelinks

Mathematics(1 entry)

mardi Publication:782910

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q782910&oldid=36603028"