On the stationarity for nonlinear optimization problems with polyhedral constraints (Q6126646): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10107-023-01979-9 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10107-023-01979-9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4377292218 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partial spectral projected gradient method with active-set strategy for linearly constrained optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-Point Step Size Gradient Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: New convergence results for the scaled gradient projection method / rank
 
Normal rank
Property / cites work
 
Property / cites work: A scaled gradient projection method for constrained image deblurring / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the solution of convex QPQC problems with elliptic and other separable constraints with strong curvature / rank
 
Normal rank
Property / cites work
 
Property / cites work: Separable spherical constraints and the decrease of a quadratic function in the gradient projection step / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Identification of Active Constraints II: The Nonconvex Case / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Identification of Active Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Projected gradient methods for linearly constrained problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Reduced-Space Algorithm for Minimizing $\ell_1$-Regularized Convex Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: FaRSA for ℓ<sub>1</sub>-regularized convex optimization: local convergence and numerical experience / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the convergence properties of scaled gradient projection methods with non-monotone Armijo-like line searches / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Subspace Acceleration Method for Minimization Involving a Group Sparsity-Inducing Regularizer / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse Approximations with Interior Point Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: A subspace-accelerated split Bregman method for sparse data recovery with joint \(\ell_1\)-type regularizers / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the steplength selection in gradient methods for unconstrained optimization / 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: Benchmarking optimization software with performance profiles. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Box Constrained Quadratic Programming with Proportioning and Projections / rank
 
Normal rank
Property / cites work
 
Property / cites work: A proportioning based algorithm with rate of convergence for bound constrained quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing quadratic functions subject to bound constraints with the rate of convergence and finite termination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4311907 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New adaptive stepsize selections in gradient methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new trust region algorithm for bound constrained minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the numerical solution of bound constrained optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Maximization of a Concave Quadratic Function with Box Constraints / 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: On the convergence properties of the projected gradient method for convex optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Solver for Nonconvex Bound-Constrained Quadratic Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Solution of Large Quadratic Programming Problems with Bound Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: An interior point-proximal method of multipliers for convex quadratic programming / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10107-023-01979-9 / rank
 
Normal rank

Latest revision as of 18:42, 30 December 2024

scientific article; zbMATH DE number 7829602
Language Label Description Also known as
English
On the stationarity for nonlinear optimization problems with polyhedral constraints
scientific article; zbMATH DE number 7829602

    Statements

    On the stationarity for nonlinear optimization problems with polyhedral constraints (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    9 April 2024
    0 references
    nonlinear programming
    0 references
    polyhedral constraints
    0 references
    stationarity
    0 references
    gradient projection
    0 references
    proportionality
    0 references
    0 references

    Identifiers