Proximity control in bundle methods for convex nondifferentiable minimization
From MaRDI portal
Publication:911994
Recommendations
- scientific article; zbMATH DE number 1420735
- A bundle Bregman proximal method for convex nondifferentiable minimization
- A tilted cutting plane proximal bundle method for convex nondifferentiable optimization
- A proximal bundle method with inexact data for convex nondifferentiable minimization
- Exact penalty functions in proximal bundle methods for constrained convex nondifferentiable minimization
Cites work
- scientific article; zbMATH DE number 3930735 (Why is no real title available?)
- scientific article; zbMATH DE number 3619637 (Why is no real title available?)
- scientific article; zbMATH DE number 3894826 (Why is no real title available?)
- A Subgradient Algorithm for Certain Minimax and Minisum Problems—The Constrained Case
- A constraint linearization method for nondifferentiable convex minimization
- A descent algorithm for nonsmooth convex optimization
- A method of linearizations for linearly constrained nonconvex nonsmooth minimization
- A modification and an extension of Lemarechal’s algorithm for nonsmooth minimization
- A regularized decomposition method for minimizing a sum of polyhedral functions
- An Exact Penalty Function Algorithm for Non-smooth Convex Constrained Minimization Problems
- An aggregate subgradient method for nonsmooth convex minimization
- An algorithm for linearly constrained convex nondifferentiable minimization problems
- Methods of descent for nondifferentiable optimization
- Monotone Operators and the Proximal Point Algorithm
- Numerical methods for nondifferentiable convex optimization
- Optimization and nonsmooth analysis
- Solution of Systems of Complex Linear Equations in the $l_\infty $ Norm with Constraints on the Unknowns
- Test examples for nonlinear programming codes
Cited in
(only showing first 100 items - show all)- Variants to the cutting plane approach for convex nondifferentiable optimization
- A quasi-second-order proximal bundle algorithm
- Three-dimensional adhesive contact laws with debonding: A nonconvex energy bundle method
- Efficient hybrid methods for global continuous optimization based on simulated annealing
- Convergence and computational analyses for some variable target value and subgradient deflection methods
- An implementation of a reduced subgradient method via Luenberger-Mokhtar variant
- Stage- and scenario-wise Fenchel decomposition for stochastic mixed 0-1 programs with special structure
- Home service routing and appointment scheduling with stochastic service times
- A hierarchy of spectral relaxations for polynomial optimization
- Sample-path optimization of convex stochastic performance functions
- A bundle-type algorithm for routing in telecommunication data networks
- Integration of progressive hedging and dual decomposition in stochastic integer programs
- An additive subfamily of enlargements of a maximally monotone operator
- Dynamic Lagrangian dual and reduced RLT constructs for solving \(0-1\) mixed-integer programs
- Comparing different nonsmooth minimization methods and software
- Lagrangian decomposition for large-scale two-stage stochastic mixed 0-1 problems
- Finding normal solutions in piecewise linear programming
- A variable metric method for nonsmooth convex constrained optimization
- A minimizing algorithm for complex nonconvex nondifferentiable functions
- An optimal variant of Kelley's cutting-plane method
- A Lagrangian relaxation approach to an electricity system investment model with a high temporal resolution
- Higher-level RLT or disjunctive cuts based on a partial enumeration strategy for 0-1 mixed-integer programs
- Constrained nonconvex nonsmooth optimization via proximal bundle method
- Implementation of an oracle-structured bundle method for distributed optimization
- Level bundle methods for oracles with on-demand accuracy
- A method for nonsmooth optimization problems
- Approximately solving multi-valued variational inequalities by using a projection and contraction algorithm
- Lagrangian smoothing heuristics for Max-cut
- Mixed method for solving the general convex programming problem
- A class of exact penalty functions and penalty algorithms for nonsmooth constrained optimization problems
- Risk aversion in two-stage stochastic integer programming
- The proximal Chebychev center cutting plane algorithm for convex additive functions
- A hybrid approach of bundle and Benders applied large mixed linear integer problem
- A second-order bundle method based on \(\mathcal{UV}\)-decomposition strategy for a special class of eigenvalue optimizations
- A computational study of exact subgraph based SDP bounds for max-cut, stable set and coloring
- Polyak minorant method for convex optimization
- A filter-variable-metric method for nonsmooth convex constrained optimization
- DYNAMICAL ADJUSTMENT OF THE PROX-PARAMETER IN BUNDLE METHODS
- A tilted cutting plane proximal bundle method for convex nondifferentiable optimization
- Nonmonotone bundle-type scheme for convex nonsmooth minimization
- Finding the closest point to the origin in the convex hull of a discrete set of points
- Separating plane algorithms for convex optimization
- Clusterwise support vector linear regression
- Conditional value-at-risk in stochastic programs with mixed-integer recourse
- A descent method with linear programming subproblems for nondifferentiable convex optimization
- A new restricted memory level bundle method for constrained convex nonsmooth optimization
- An asynchronous proximal bundle method
- A multi-step doubly stabilized bundle method for nonsmooth convex optimization
- Bundle-level type methods uniformly optimal for smooth and nonsmooth convex optimization
- A proximal cutting plane method using Chebychev center for nonsmooth convex optimization
- A class of infeasible proximal bundle methods for nonsmooth nonconvex multi-objective optimization problems
- Efficiency of proximal bundle methods
- A variable target value method for nondifferentiable optimization
- Convergence analysis of a proximal newton method1
- Surface fitting and registration of point clouds using approximations of the unsigned distance function
- On the generalization of ECP and OA methods to nonsmooth convex MINLP problems
- The bundle scheme for solving arbitrary eigenvalue optimizations
- On solving the convex semi-infinite minimax problems via superlinear \(\mathcal{VU}\) incremental bundle technique with partial inexact oracle
- Spectral bundle methods for non-convex maximum eigenvalue functions: first-order methods
- A quasisecant method for solving a system of nonsmooth equations
- A new proximal Chebychev center cutting plane algorithm for nonsmooth optimization and its convergence
- An adaptive competitive penalty method for nonsmooth constrained optimization
- Exact penalty functions in proximal bundle methods for constrained convex nondifferentiable minimization
- Strongly sub-feasible direction method for constrained optimization problems with nonsmooth objective functions
- A modified Hestenes and Stiefel conjugate gradient algorithm for large-scale nonsmooth minimizations and nonlinear equations
- On deviation measures in stochastic integer programming
- A redistributed bundle algorithm based on local convexification models for nonlinear nonsmooth DC programming
- A modified PRP conjugate gradient algorithm with nonmonotone line search for nonsmooth convex optimization problems
- Essentials of numerical nonsmooth optimization
- Trust-region methods for the derivative-free optimization of nonsmooth black-box functions
- Constraint aggregation principle in convex optimization
- An efficient descent method for locally Lipschitz multiobjective optimization problems
- Stochastic dynamic cutting plane for multistage stochastic convex programs
- A doubly stabilized bundle method for nonsmooth convex optimization
- Large-scale optimization with the primal-dual column generation method
- scientific article; zbMATH DE number 1420735 (Why is no real title available?)
- A unifying framework for several cutting plane methods for semidefinite programming
- Survey of Bundle Methods for Nonsmooth Optimization
- Canonical duality for solving nonconvex and nonsmooth optimization problem
- Computation of approximate -points for large scale single machine scheduling problem
- Approximations in proximal bundle methods and decomposition of convex programs
- Lagrangian decomposition of block-separable mixed-integer all-quadratic programs
- A stochastic integer programming model for incorporating day-ahead trading of electricity into hydro-thermal unit commitment
- On Second-Order Properties of the Moreau–Yosida Regularization for Constrained Nonsmooth Convex Programs
- A parallel interior point decomposition algorithm for block angular semidefinite programs
- Solving nonlinear programming problems with noisy function values and noisy gradients
- Linear convergence of the derivative-free proximal bundle method on convex nonsmooth functions, with application to the derivative-free \(\mathcal{VU}\)-algorithm
- A Method for Minimization of Quasidifferentiable Functions
- On approximations with finite precision in bundle methods for nonsmooth optimization
- On the global convergence of a nonmonotone proximal bundle method for convex nonsmooth minimization
- Semidefinite programming
- Optimal Convergence Rates for the Proximal Bundle Method
- Automation and Combination of Linear-Programming Based Stabilization Techniques in Column Generation
- A hybrid conjugate gradient algorithm for nonconvex functions and its applications in image restoration problems
- Role of subgradients in variational analysis of polyhedral functions
- Direct approach to the minimization of the maximal stress over an arch structure
- Numerical infinitesimals in a variable metric method for convex nonsmooth optimization
- Reduced subgradient bundle method for linearly constrained non-smooth non-convex problems
- An alternating linearization bundle method for convex optimization and nonlinear multicommodity flow problems
- Stabilized Benders decomposition for energy planning under climate uncertainty
This page was built for publication: Proximity control in bundle methods for convex nondifferentiable minimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q911994)
