A bundle-filter method for nonsmooth convex constrained optimization
From MaRDI portal
Publication:959944
DOI10.1007/s10107-007-0123-7zbMath1165.90024OpenAlexW2146232856MaRDI QIDQ959944
Elizabeth W. Karas, Ademir Alves Ribeiro, Claudia A. Sagastizábal, Mikhail V. Solodov
Publication date: 16 December 2008
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-007-0123-7
Related Items (43)
A feasible proximal bundle algorithm with convexification for nonsmooth, nonconvex semi-infinite programming ⋮ Line search filter inexact secant methods for nonlinear equality constrained optimization ⋮ Solving generation expansion planning problems with environmental constraints by a bundle method ⋮ Computing proximal points of convex functions with inexact subgradients ⋮ Level bundle methods for constrained convex optimization with various oracles ⋮ An incremental bundle method for portfolio selection problem under second-order stochastic dominance ⋮ An improved nonmonotone filter trust region method for equality constrained optimization ⋮ A proximal bundle method for constrained nonsmooth nonconvex optimization with inexact information ⋮ Global convergence of a derivative-free inexact restoration filter algorithm for nonlinear programming ⋮ Strongly sub-feasible direction method for constrained optimization problems with nonsmooth objective functions ⋮ An improved line search filter method for the system of nonlinear equations ⋮ A hybrid method combining genetic algorithm and Hooke-Jeeves method for constrained global optimization ⋮ A nonmonotone line search filter algorithm for the system of nonlinear equations ⋮ Evolution differential inclusion with projection for solving constrained nonsmooth convex optimization in Hilbert space ⋮ A two-phase algorithm for a variational inequality formulation of equilibrium problems ⋮ Unnamed Item ⋮ Global convergence of a general filter algorithm based on an efficiency condition of the step ⋮ First-order and second-order optimality conditions for nonsmooth constrained problems via convolution smoothing ⋮ Unnamed Item ⋮ A filter-based artificial fish swarm algorithm for constrained global optimization: theoretical and practical issues ⋮ A feasible point method with bundle modification for nonsmooth convex constrained optimization ⋮ Ergodic, primal convergence in dual subgradient schemes for convex programming. II: The case of inconsistent primal problems ⋮ A nonmonotone filter method for nonlinear optimization ⋮ An inexact spectral bundle method for convex quadratic semidefinite programming ⋮ A new infeasible proximal bundle algorithm for nonsmooth nonconvex constrained optimization ⋮ A Filter Active-Set Algorithm for Ball/Sphere Constrained Optimization Problem ⋮ A filter proximal bundle method for nonsmooth nonconvex constrained optimization ⋮ Acceleration techniques for level bundle methods in weakly smooth convex constrained optimization ⋮ Filter-based DIRECT method for constrained global optimization ⋮ Local convergence of filter methods for equality constrained non-linear programming ⋮ A Dynamical Approach to Constrained Nonsmooth Convex Minimization Problem Coupling with Penalty Function Method in Hilbert Space ⋮ A filter-variable-metric method for nonsmooth convex constrained optimization ⋮ Derivative-free nonlinear optimization filter simplex ⋮ An inexact bundle variant suited to column generation ⋮ Derivative-free optimization and filter methods to solve nonlinear constrained problems ⋮ A proximal-projection partial bundle method for convex constrained minimax problems ⋮ An Algorithm Using Trust Region Strategy for Minimization of a Nondifferentiable Function ⋮ A new restricted memory level bundle method for constrained convex nonsmooth optimization ⋮ A splitting bundle approach for non-smooth non-convex minimization ⋮ A proximal bundle method-based algorithm with penalty strategy and inexact oracles for constrained nonsmooth nonconvex optimization ⋮ A line search filter inexact reduced Hessian method for nonlinear equality constrained optimization ⋮ A Proximal Bundle Method with Exact Penalty Technique and Bundle Modification Strategy for Nonconvex Nonsmooth Constrained Optimization ⋮ A method for solving some optimization problems with bounds on variables
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A constraint linearization method for nondifferentiable convex minimization
- Test examples for nonlinear programming codes
- Exact penalty functions in proximal bundle methods for constrained convex nondifferentiable minimization
- A bundle-Newton method for nonsmooth unconstrained minimization
- Variable metric bundle methods: From conceptual to implementable forms
- How to deal with the unbounded in optimization: Theory and algorithms
- Globally convergent variable metric method for convex nonsmooth unconstrained minimization
- New variants of bundle methods
- Methods of descent for nondifferentiable optimization
- Solving semidefinite quadratic problems within nonsmooth optimization algorithms
- On the quadratic programming algorithm of Goldfarb and Idnani
- A Method for Solving Certain Quadratic Programming Problems Arising in Nonsmooth Optimization
- A modification and an extension of Lemarechal’s algorithm for nonsmooth minimization
- An Algorithm for Constrained Optimization with Semismooth Functions
- DYNAMICAL ADJUSTMENT OF THE PROX-PARAMETER IN BUNDLE METHODS
- A Globally Convergent Filter Method for Nonlinear Programming
- Numerical methods for nondifferentiable convex optimization
- On the Global Convergence of a Filter--SQP Algorithm
- Generalized Bundle Methods
- Global Convergence of a Trust-Region SQP-Filter Algorithm for General Nonlinear Programming
- An Exact Penalty Function Algorithm for Non-smooth Convex Constrained Minimization Problems
- An Infeasible Bundle Method for Nonsmooth Convex Constrained Optimization without a Penalty Function or a Filter
- Algorithm 811: NDA
- Nonlinear programming without a penalty function.
This page was built for publication: A bundle-filter method for nonsmooth convex constrained optimization
