A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results
From MaRDI portal
Publication:4018388
DOI10.1137/0802008zbMath0761.90090OpenAlexW2041928877MaRDI QIDQ4018388
Publication date: 16 January 1993
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0802008
Nonlinear programming (90C30) Nonsmooth analysis (49J52) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
Large-scale optimization with the primal-dual column generation method, Challenges in optimization with complex PDE-systems. Abstracts from the workshop held February 14--20, 2021 (hybrid meeting), Canonical duality for solving nonconvex and nonsmooth optimization problem, A primal-dual algorithm for risk minimization, A computational study of graph partitioning, A modified PRP conjugate gradient algorithm with nonmonotone line search for nonsmooth convex optimization problems, Bundle-based descent method for nonsmooth multiobjective DC optimization with inequality constraints, Approximations in proximal bundle methods and decomposition of convex programs, Nonconvex bundle method with application to a delamination problem, Scenario analysis via bundle decomposition, Computational efficiency of the simplex embedding method in convex nondifferentiable optimization, Separating plane algorithms for convex optimization, Variable metric bundle methods: From conceptual to implementable forms, Solving nonlinear multicommodity flow problems by the analytic center cutting plane method, On bilevel programming. I: General nonlinear cases, A projection technique for partitioning the nodes of a graph, Optimal prestress of structures with frictional unilateral contact interfaces, A descent proximal level bundle method for convex nondifferentiable optimization, On numerical solution of hemivariational inequalities by nonsmooth optimization methods, Non-smooth optimization for robust control of infinite-dimensional systems, Sample-path optimization of convex stochastic performance functions, An optimal variant of Kelley's cutting-plane method, Algorithms for the solution of stochastic dynamic minimax problems, A variable metric method for nonsmooth convex constrained optimization, Globally convergent limited memory bundle method for large-scale nonsmooth optimization, Bounds for the quadratic assignment problem using the bundle method, New models for optimal truss topology in limit design based on unified elastic/plastic analysis, Lower bounds for the quadratic assignment problem via triangle decompositions, A bundle modification strategy for convex minimization, Smooth transformation of the generalized minimax problem, The proximal Chebychev center cutting plane algorithm for convex additive functions, A quasi-second-order proximal bundle algorithm, On approximations with finite precision in bundle methods for nonsmooth optimization, A hybrid approach of bundle and Benders applied large mixed linear integer problem, Solving generation expansion planning problems with environmental constraints by a bundle method, Partitioning mathematical programs for parallel solution, New variants of bundle methods, A multi-step doubly stabilized bundle method for nonsmooth convex optimization, A feasible directions method for nonsmooth convex optimization, Method for solving generalized convex nonsmooth mixed-integer nonlinear programming problems, Mathematical programming formulations for piecewise polynomial functions, Approximately solving multi-valued variational inequalities by using a projection and contraction algorithm, Cutting plane oracles to minimize non-smooth non-convex functions, Optimal design of brittle composite materials: a nonsmooth approach, Generalized order-value optimization, Gradient trust region algorithm with limited memory BFGS update for nonsmooth convex minimization, An additive subfamily of enlargements of a maximally monotone operator, A trust region algorithm with adaptive cubic regularization methods for nonsmooth convex minimization, A partially inexact bundle method for convex semi-infinite minmax problems, A new proximal Chebychev center cutting plane algorithm for nonsmooth optimization and its convergence, An infeasible bundle method for nonconvex constrained optimization with application to semi-infinite programming problems, On optimal control of a sweeping process coupled with an ordinary differential equation, Proximal bundle algorithms for nonlinearly constrained convex minimax fractional programs, Constrained nonconvex nonsmooth optimization via proximal bundle method, Improving the performance of stochastic dual dynamic programming, Diagonal bundle method for nonsmooth sparse optimization, A redistributed bundle algorithm based on local convexification models for nonlinear nonsmooth DC programming, A discretization algorithm for nonsmooth convex semi-infinite programming problems based on bundle methods, A smooth method for the finite minimax problem, An inexact spectral bundle method for convex quadratic semidefinite programming, Globally convergent cutting plane method for nonconvex nonsmooth minimization, New filled functions for nonsmooth global optimization, A novel convex dual approach to three-dimensional assignment problem: theoretical analysis, A one-parameter filled function for nonsmooth global optimization and its application, On the convergence of the iterates of proximal gradient algorithm with extrapolation for convex nonsmooth minimization problems, Optimization problems with equilibrium constraints and their numerical solution., Non-Euclidean restricted memory level method for large-scale convex optimization, A new method based on the proximal bundle idea and gradient sampling technique for minimizing nonsmooth convex functions, An effective line search for the subgradient method, A filter-variable-metric method for nonsmooth convex constrained optimization, Some experiments on heuristic code selection versus numerical performance in nonlinear programming, A numerical approach to optimization problems with variational inequality constraints, A Newton method for a class of quasi-variational inequalities, Globally convergent variable metric method for convex nonsmooth unconstrained minimization, A proximal cutting plane method using Chebychev center for nonsmooth convex optimization, Direct approach to the minimization of the maximal stress over an arch structure, Optimal control of flow with discontinuities., On the choice of explicit stabilizing terms in column generation, A combined transportation and scheduling problem, A conjugate gradient algorithm and its application in large-scale optimization problems and image restoration, A limited memory BFGS subspace algorithm for bound constrained nonsmooth problems, An approach for robust PDE-constrained optimization with application to shape optimization of electrical engines and of dynamic elastic structures under uncertainty, Efficiency of proximal bundle methods, Three-dimensional adhesive contact laws with debonding: A nonconvex energy bundle method, A bundle-Newton method for nonsmooth unconstrained minimization, An optimal tree search method for the manufacturing systems cell formation problem, A new restricted memory level bundle method for constrained convex nonsmooth optimization, Optimal prestress of cracked unilateral structures: Finite element analysis of an optimal control problem for variational inequalities., Interior-point methods with decomposition for solving large-scale linear programs, Nonsmooth optimization methods for parallel decomposition of multicommodity flow problems, Node and edge relaxations of the max-cut problem, Complementarity problems in GAMS and the PATH solver, Implementation of a proximal algorithm for linearly constrained nonsmooth optimization problems and computational results, Bundle trust-region algorithm for bilinear bilevel programming, Nonmonotone bundle-type scheme for convex nonsmooth minimization, Necessary optimality conditions for Stackelberg problems, Convergence of some algorithms for convex minimization, A modified Hestenes and Stiefel conjugate gradient algorithm for large-scale nonsmooth minimizations and nonlinear equations, Nonsmooth bundle trust-region algorithm with applications to robust stability, Global minimization by reducing the duality gap, High fidelity multidisciplinary design optimization of a wing using the interaction of low and high fidelity models, Combining discrete and continuous optimization to solve kinodynamic motion planning problems, A Trust-region Method for Nonsmooth Nonconvex Optimization, Inverse truss design as a conic mathematical program with equilibrium constraints, A Bundle Trust Region Algorithm for Minimizing Locally Lipschitz Functions, Comparing different nonsmooth minimization methods and software, Tuning strategy for the proximity parameter in convex minimization, A Sequential Smooth Penalization Approach to Mathematical Programs with Complementarity Constraints, The marginal value formula in input optimization, Survey of Bundle Methods for Nonsmooth Optimization, Cutting Plane Methods Based on the Analytic Barrier for Minimization of a Convex Function Subject to Box-Constraints, A quasi-Newton proximal bundle method using gradient sampling technique for minimizing nonsmooth convex functions, DYNAMICAL ADJUSTMENT OF THE PROX-PARAMETER IN BUNDLE METHODS, A vector forward mode of automatic differentiation for generalized derivative evaluation, Dynamic bundle methods, Piecewise linear approximations in nonconvex nonsmooth optimization, A proximal alternating linearization method for nonconvex optimization problems, The spectral bundle method with second-order information, A bundle-type algorithm for routing in telecommunication data networks, A proximal bundle method for nonsmooth DC optimization utilizing nonconvex cutting planes, Fictitious domain/mixed finite element approach for a class of optimal shape design problems, A simple version of bundle method with linear programming, Clusterwise support vector linear regression, A version of bundle trust region method with linear programming, Adaptive Bundle Methods for Nonlinear Robust Optimization, A Sequential Quadratic Programming Algorithm for Nonsmooth Problems with Upper- \({\boldsymbol{\mathcal{C}^2}}\) Objective, Semismoothness for Solution Operators of Obstacle-Type Variational Inequalities with Applications in Optimal Control, Proximal bundle methods based on approximate subgradients for solving Lagrangian duals of minimax fractional programs, On optimization of systems governed by implicit complementarity problems*, Limited memory interior point bundle method for large inequality constrained nonsmooth minimization, A study of auction mechanisms for multilateral procurement based on subgradient and bundle methods, Minimizing oracle-structured composite functions, A proximal bundle method for a class of nonconvex nonsmooth composite optimization problems, Solution of 3D contact shape optimization problems with Coulomb friction based on TFETI., A Measure Approximation for Distributionally Robust PDE-Constrained Optimization Problems, The parameter identification in the Stokes system with threshold slip boundary conditions, A new nonmonotone line search method for nonsmooth nonconvex optimization, A Nonsmooth Trust-Region Method for Locally Lipschitz Functions with Application to Optimization Problems Constrained by Variational Inequalities, Stabilized column generation for highly degenerate multiple-depot vehicle scheduling problems, Solving dual problems using a coevolutionary optimization algorithm, Epi-Regularization of Risk Measures, Risk-averse optimal control of semilinear elliptic PDEs, On the global convergence of a nonmonotone proximal bundle method for convex nonsmooth minimization, Difference convex optimization techniques in nonsmooth computational mechanics, Nonsmooth cryptanalysis, with an application to the stream cipher MICKEY, Multiple subgradient descent bundle method for convex nonsmooth multiobjective optimization, Bundle methods for sum-functions with ``easy components: applications to multicommodity network design, A modified Polak-Ribière-Polyak conjugate gradient algorithm for nonsmooth convex programs, Computation of approximate \(\alpha \)-points for large scale single machine scheduling problem, Risk-Averse PDE-Constrained Optimization Using the Conditional Value-At-Risk, Minimization of marginal functions in mathematical programming based on continuous outer subdifferentials, Bundle Method for Non-Convex Minimization with Inexact Subgradients and Function Values, A DC piecewise affine model and a bundling technique in nonconvex nonsmooth minimization, Bundle-based relaxation methods for multicommodity capacitated fixed charge network design, Semidefinite programming lower bounds and branch-and-bound algorithms for the quadratic minimum spanning tree problem, Adaptive limited memory bundle method for bound constrained large-scale nonsmooth optimization, A minimax resource allocation problem with variable resources, Gobally convergent variable metric method for nonconvex nondifferentiable unconstrained minimization, A Redistributed Bundle Algorithm for Generalized Variational Inequality Problems in Hilbert Spaces, Double Bundle Method for finding Clarke Stationary Points in Nonsmooth DC Programming, Residual Selection in A Projection Method for Convex Minimization Problems, Trust-Region Methods for the Derivative-Free Optimization of Nonsmooth Black-Box Functions, A branch and bound algorithm for the minimum storage-time sequencing problem, Essentials of numerical nonsmooth optimization, Minimizing Piecewise-Concave Functions Over Polyhedra, Diagonal discrete gradient bundle method for derivative free nonsmooth optimization, Duality Results and Dual Bundle Methods Based on the Dual Method of Centers for Minimax Fractional Programs, Nonsmooth and nonconvex optimization via approximate difference-of-convex decompositions, Subgradient and Bundle Methods for Nonsmooth Optimization, On the generalization of ECP and OA methods to nonsmooth convex MINLP problems, Random perturbation of the projected variable metric method for nonsmooth nonconvex optimization problems with linear constraints, Solving semidefinite quadratic problems within nonsmooth optimization algorithms, Mathematical Programs with Equilibrium Constraints: A Brief Survey of Methods and Optimality Conditions, A splitting bundle approach for non-smooth non-convex minimization, A proximal trust-region algorithm for column generation stabilization, Semismoothness of solutions to generalized equations and the Moreau-Yosida regularization, Spectral bundle methods for non-convex maximum eigenvalue functions: first-order methods, A new nonsmooth trust region algorithm for locally Lipschitz unconstrained optimization problems, Computational experience with a bundle approach for semidefinite cutting plane relaxations of Max-Cut and equipartition, Essentials of numerical nonsmooth optimization, Non-smooth optimization based on resilient backpropagation search for unconstrained and simply bounded problems, Limited memory discrete gradient bundle method for nonsmooth derivative-free optimization
