Limited memory interior point bundle method for large inequality constrained nonsmooth minimization (Q2425996): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: LDGB / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.amc.2007.08.044 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2044941703 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple primal-dual feasible interior-point method for nonlinear programming with monotone descent / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-Euclidean restricted memory level method for large-scale convex optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization of upper semidifferentiable functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Representations of quasi-Newton matrices and their use in limited memory methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4000274 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4226179 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some numerical experiments with variable-storage quasi-Newton algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: New limited memory bundle method for large-scale nonsmooth optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Globally convergent limited memory bundle method for large-scale nonsmooth optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Feasible direction interior-point technique for nonlinear optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Exact Penalty Function Algorithm for Non-smooth Convex Constrained Minimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Methods of descent for nondifferentiable optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A method of linearizations for linearly constrained nonconvex nonsmooth minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A constraint linearization method for nondifferentiable convex minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact penalty functions in proximal bundle methods for constrained convex nondifferentiable minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: New variants of bundle methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3316093 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Globally convergent variable metric method for convex nonsmooth unconstrained minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4004158 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A modification and an extension of Lemarechal’s algorithm for nonsmooth minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Updating Quasi-Newton Matrices with Limited Storage / rank
 
Normal rank
Property / cites work
 
Property / cites work: A QP-Free, Globally Convergent, Locally Superlinearly Convergent Algorithm for Inequality Constrained Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Infeasible Bundle Method for Nonsmooth Convex Constrained Optimization without a Penalty Function or a Filter / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Primal-Dual Interior-Point Method for Nonlinear Programming with Strong Global and Local Convergence Properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gobally convergent variable metric method for nonconvex nondifferentiable unconstrained minimization / rank
 
Normal rank

Latest revision as of 20:48, 27 June 2024

scientific article
Language Label Description Also known as
English
Limited memory interior point bundle method for large inequality constrained nonsmooth minimization
scientific article

    Statements

    Limited memory interior point bundle method for large inequality constrained nonsmooth minimization (English)
    0 references
    0 references
    17 April 2008
    0 references
    nondifferentiable programming
    0 references
    large-scale problems
    0 references
    constrained optimization
    0 references
    limited memory methods
    0 references
    feasible direction interior point methods
    0 references
    nonconvex
    0 references
    nonsmooth
    0 references
    variable metric bundle method
    0 references
    numerical experiments
    0 references
    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