Proximity control in bundle methods for convex nondifferentiable minimization

From MaRDI portal

Publication:911994

Jump to:navigation, search

DOI10.1007/BF01585731zbMath0697.90060OpenAlexW2091371007MaRDI QIDQ911994

Krzysztof C. Kiwiel

Publication date: 1990

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01585731

zbMATH Keywords

proximal bundle method convex nondifferentiable minimization

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Mathematical programming (90C99)

Related Items

A method for nonsmooth optimization problems, Comparing different nonsmooth minimization methods and software, A method for non-differentiable optimization problems, The bundle scheme for solving arbitrary eigenvalue optimizations, Survey of Bundle Methods for Nonsmooth Optimization, A Method for Minimization of Quasidifferentiable Functions, 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 tilted cutting plane proximal bundle method for convex nondifferentiable optimization, A Second-Order Bundle Method Based on -Decomposition Strategy for a Special Class of Eigenvalue Optimizations, Level bundle methods for oracles with on-demand accuracy, A bundle-type algorithm for routing in telecommunication data networks, Lagrange dual bound computation for stochastic service network design, A hierarchy of spectral relaxations for polynomial optimization, A hybrid conjugate gradient algorithm for nonconvex functions and its applications in image restoration problems, Role of subgradients in variational analysis of polyhedral functions, Optimal Convergence Rates for the Proximal Bundle Method, A study of auction mechanisms for multilateral procurement based on subgradient and bundle methods, Variants to the cutting plane approach for convex nondifferentiable optimization, Minimizing oracle-structured composite functions, A derivative-free 𝒱𝒰-algorithm for convex finite-max problems, A Lagrangian relaxation approach to an electricity system investment model with a high temporal resolution, An approach to robust network design in telecommunications, A class of infeasible proximal bundle methods for nonsmooth nonconvex multi-objective optimization problems, Recent Progress in Two-stage Mixed-integer Stochastic Programming with Applications to Power Production Planning, Integer set reduction for stochastic mixed-integer programming, Automation and Combination of Linear-Programming Based Stabilization Techniques in Column Generation, On the global convergence of a nonmonotone proximal bundle method for convex nonsmooth minimization, Interactive bundle-based method for nondifferentiable multiobjeective optimization: nimbus^§, Risk Aversion in Two-Stage Stochastic Integer Programming, Multiple subgradient descent bundle method for convex nonsmooth multiobjective optimization, On deviation measures in stochastic integer programming, Lagrangian smoothing heuristics for Max-cut, On Second-Order Properties of the Moreau–Yosida Regularization for Constrained Nonsmooth Convex Programs, A strongly convergent proximal bundle method for convex minimization in Hilbert spaces, Double Bundle Method for finding Clarke Stationary Points in Nonsmooth DC Programming, Trust-Region Methods for the Derivative-Free Optimization of Nonsmooth Black-Box Functions, Bundle-level type methods uniformly optimal for smooth and nonsmooth convex optimization, A quasi-Newton method for unconstrained non-smooth problems, Essentials of numerical nonsmooth optimization, A unifying framework for several cutting plane methods for semidefinite programming, An implementation of a reduced subgradient method via Luenberger-Mokhtar variant, Convergence analysis of a proximal newton method¹, Duality Results and Dual Bundle Methods Based on the Dual Method of Centers for Minimax Fractional Programs, Subgradient and Bundle Methods for Nonsmooth Optimization, On the generalization of ECP and OA methods to nonsmooth convex MINLP problems, Efficient hybrid methods for global continuous optimization based on simulated annealing, A stochastic integer programming model for incorporating day-ahead trading of electricity into hydro-thermal unit commitment, Spectral bundle methods for non-convex maximum eigenvalue functions: first-order methods, Spectral bundle methods for non-convex maximum eigenvalue functions: second-order methods, Reduced subgradient bundle method for linearly constrained non-smooth non-convex problems, Conditional value-at-risk in stochastic programs with mixed-integer recourse, Essentials of numerical nonsmooth optimization, A Proximal Bundle Method with Exact Penalty Technique and Bundle Modification Strategy for Nonconvex Nonsmooth Constrained Optimization, On Solving the Convex Semi-Infinite Minimax Problems via Superlinear 𝒱𝒰 Incremental Bundle Technique with Partial Inexact Oracle, Large-scale optimization with the primal-dual column generation method, Scalable branching on dual decomposition of stochastic mixed-integer programming problems, Canonical duality for solving nonconvex and nonsmooth optimization problem, A cross-decomposition scheme with integrated primal-dual multi-cuts for two-stage stochastic programming investment planning problems, Tuning strategy for the proximity parameter in convex minimization, 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, Scenario analysis via bundle decomposition, Constraint aggregation principle in convex optimization, Separating plane algorithms for convex optimization, Variable metric bundle methods: From conceptual to implementable forms, Finding normal solutions in piecewise linear programming, Convergence and computational analyses for some variable target value and subgradient deflection methods, Solving nonlinear multicommodity flow problems by the analytic center cutting plane method, Stage- and scenario-wise Fenchel decomposition for stochastic mixed 0-1 programs with special structure, A minimizing algorithm for complex nonconvex nondifferentiable functions, A descent proximal level bundle method for convex nondifferentiable optimization, On numerical solution of hemivariational inequalities by nonsmooth optimization methods, Sample-path optimization of convex stochastic performance functions, Cluster Lagrangean decomposition in multistage stochastic optimization, An optimal variant of Kelley's cutting-plane method, A variable metric method for nonsmooth convex constrained optimization, A proximal bundle method for nonsmooth DC optimization utilizing nonconvex cutting planes, Solving large-scale semidefinite programs in parallel, A bundle modification strategy for convex minimization, 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, Proximal level bundle methods for convex nondifferentiable optimization, saddle-point problems and variational inequalities, New variants of bundle methods, A multi-step doubly stabilized bundle method for nonsmooth convex optimization, A descent method with linear programming subproblems for nondifferentiable convex optimization, Computing proximal points of convex functions with inexact subgradients, Approximately solving multi-valued variational inequalities by using a projection and contraction algorithm, Fast bundle-level methods for unconstrained and ball-constrained convex optimization, Clusterwise support vector linear regression, Dynamic Lagrangian dual and reduced RLT constructs for solving \(0-1\) mixed-integer programs, Numerical infinitesimals in a variable metric method for convex nonsmooth optimization, Proximal bundle methods based on approximate subgradients for solving Lagrangian duals of minimax fractional programs, Lagrangian decomposition for large-scale two-stage stochastic mixed 0-1 problems, A computational study of exact subgraph based SDP bounds for max-cut, stable set and coloring, Surface fitting and registration of point clouds using approximations of the unsigned distance function, An additive subfamily of enlargements of a maximally monotone operator, A partially inexact bundle method for convex semi-infinite minmax problems, Recourse-based stochastic nonlinear programming: properties and Benders-SQP algorithms, Strongly sub-feasible direction method for constrained optimization problems with nonsmooth objective functions, An alternating linearization bundle method for convex optimization and nonlinear multicommodity flow problems, A new proximal Chebychev center cutting plane algorithm for nonsmooth optimization and its convergence, An infeasible-point subgradient method using adaptive approximate projections, A variable target value method for nondifferentiable optimization, Proximal bundle algorithms for nonlinearly constrained convex minimax fractional programs, Constrained nonconvex nonsmooth optimization via proximal bundle method, Exact penalty functions in proximal bundle methods for constrained convex nondifferentiable minimization, A redistributed bundle algorithm based on local convexification models for nonlinear nonsmooth DC programming, A modified nonlinear conjugate gradient algorithm for large-scale nonsmooth convex optimization, Min-Max MPC based on a network problem, A feasible point method with bundle modification for nonsmooth convex constrained optimization, A quasisecant method for solving a system of nonsmooth equations, An adaptive competitive penalty method for nonsmooth constrained optimization, A modified Polak-Ribière-Polyak conjugate gradient algorithm for nonsmooth convex programs, Higher-level RLT or disjunctive cuts based on a partial enumeration strategy for 0-1 mixed-integer programs, An inexact spectral bundle method for convex quadratic semidefinite programming, Computation of approximate \(\alpha \)-points for large scale single machine scheduling problem, A parallel interior point decomposition algorithm for block angular semidefinite programs, Solving nonlinear programming problems with noisy function values and noisy gradients, Visualization of the \(\varepsilon \)-subdifferential of piecewise linear-quadratic functions, Lagrangian decomposition of block-separable mixed-integer all-quadratic programs, A new method based on the proximal bundle idea and gradient sampling technique for minimizing nonsmooth convex functions, Acceleration techniques for level bundle methods in weakly smooth convex constrained optimization, Portfolio optimization by minimizing conditional value-at-risk via nondifferentiable optimization, Integration of progressive hedging and dual decomposition in stochastic integer programs, Home service routing and appointment scheduling with stochastic service times, Resource allocation for contingency planning: an inexact proximal bundle method for stochastic optimization, An efficient descent method for locally Lipschitz multiobjective optimization problems, Stochastic dynamic cutting plane for multistage stochastic convex programs, Semisupervised spherical separation, A filter-variable-metric method for nonsmooth convex constrained optimization, A family of variable metric proximal methods, Finding the closest point to the origin in the convex hull of a discrete set of points, A proximal cutting plane method using Chebychev center for nonsmooth convex optimization, Convergence analysis of some methods for minimizing a nonsmooth convex function, Direct approach to the minimization of the maximal stress over an arch structure, A class of exact penalty functions and penalty algorithms for nonsmooth constrained optimization problems, A limited memory BFGS subspace algorithm for bound constrained nonsmooth problems, Efficiency of proximal bundle methods, Three-dimensional adhesive contact laws with debonding: A nonconvex energy bundle method, Mixed method for solving the general convex programming problem, A new restricted memory level bundle method for constrained convex nonsmooth optimization, Primal convergence from dual subgradient methods for convex optimization, Dual decomposition in stochastic integer programming, Nonsmooth optimization methods for parallel decomposition of multicommodity flow problems, Semidefinite programming, Aggregate codifferential method for nonsmooth DC optimization, Implementation of a proximal algorithm for linearly constrained nonsmooth optimization problems and computational results, Nonmonotone bundle-type scheme for convex nonsmooth minimization, Convergence of some algorithms for convex minimization, A modified Hestenes and Stiefel conjugate gradient algorithm for large-scale nonsmooth minimizations and nonlinear equations, A doubly stabilized bundle method for nonsmooth convex optimization

Cites Work

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:911994&oldid=12874702"