scientific article; zbMATH DE number 3894826

Publication date: 1985

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

subgradient method applications locally Lipschitz functions nonsmooth functions nonlinear minimax problems space dilatation methods

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Methods of successive quadratic programming type (90C55)

Related Items

An efficient preprocessing procedure for the multidimensional 0-1 knapsack problem, Nonmonotone stabilization methods for nonlinear equations, On using approximations of the Benders master problem, The symmetric rank-one quasi-Newton method is a space-dilation subgradient algorithm, Combination of steepest descent and BFGS methods for nonconvex nonsmooth optimization, Obtaining lower bounds from the progressive hedging algorithm for stochastic mixed-integer programs, Optimal placement of irradiation sources in the planning of radiotherapy: mathematical models and methods of solving, An ODE-based trust region method for unconstrained optimization problems, A dual method for minimizing a nonsmooth objective over one smooth inequality constraint, Algorithms for the continuous nonlinear resource allocation problem -- new implementations and numerical studies, Convergence and computational analyses for some variable target value and subgradient deflection methods, On numerical solving the spherical separability problem, A Lagrangian heuristic for sprint planning in agile software development, Applications of gauge duality in robust principal component analysis and semidefinite programming, An algorithm for nondifferentiable optimization, Wave simulation in 2D heterogeneous transversely isotropic porous media with fractional attenuation: a Cartesian grid approach, Subgradient method for nonconvex nonsmooth optimization, A bundle modification strategy for convex minimization, A hybrid approach of bundle and Benders applied large mixed linear integer problem, Subgradient projection algorithms and approximate solutions of convex feasibility problems, Approximating Clarke's subgradients of semismooth functions by divided differences, Spectral projected subgradient with a momentum term for the Lagrangean dual approach, PyOpt: a python-based object-oriented framework for nonlinear constrained optimization, A subgradient method for multiobjective optimization on Riemannian manifolds, Sparse nonnegative matrix underapproximation and its application to hyperspectral image analysis, The CoMirror algorithm for solving nonsmooth constrained convex problems, iPiasco: inertial proximal algorithm for strongly convex optimization, Gradient-only approaches to avoid spurious local minima in unconstrained optimization, First-order methods of smooth convex optimization with inexact oracle, Subgradient methods for huge-scale optimization problems, Approximate level method for nonsmooth convex minimization, Subgradient method for convex feasibility on Riemannian manifolds, Determining six cardiac conductivities from realistically large datasets, A system of nonsmooth equations solver based upon subgradient method, The minimum spanning tree problem with conflict constraints and its variations, A partially inexact bundle method for convex semi-infinite minmax problems, Strongly sub-feasible direction method for constrained optimization problems with nonsmooth objective functions, Proximity control in bundle methods for convex nondifferentiable minimization, Multi-level production scheduling for a class of flexible machining and assembly systems, A characterization of optimal scaling for structured singular value computation, An infeasible-point subgradient method using adaptive approximate projections, Dual quadratic estimates in polynomial and Boolean programming, Variable target value subgradient method, Interior epigraph directions method for nonsmooth and nonconvex optimization via generalized augmented Lagrangian duality, Least quantile regression via modern optimization, A strongly polynomial-time algorithm for the strict homogeneous linear-inequality feasibility problem, A method for approximating the solution set of a system of convex inequalities by polytopes, Diagonal bundle method for nonsmooth sparse optimization, An exact algorithm for cost minimization in series reliability systems with multiple component choices, Dynamic smoothness parameter for fast gradient methods, Projection algorithms for linear programming, Differentiable McCormick relaxations, A spline smoothing Newton method for finite minimax problems, A smooth method for the finite minimax problem, Dual estimates in multiextremal problems, An adaptive competitive penalty method for nonsmooth constrained optimization, Ergodic, primal convergence in dual subgradient schemes for convex programming. II: The case of inconsistent primal problems, Higher-level RLT or disjunctive cuts based on a partial enumeration strategy for 0-1 mixed-integer programs, Using underapproximations for sparse nonnegative matrix factorization, New filled functions for nonsmooth global optimization, Nondifferentiable optimization via smooth approximation: General analytical approach, A one-parameter filled function for nonsmooth global optimization and its application, Dynamic system methods for solving mixed linear matrix inequalities and linear vector inequalities and equalities, On embedding the volume algorithm in a variable target value method., Benefit sharing in holding situations, A truncated aggregate smoothing Newton method for minimax problems, Tetrolet shrinkage with anisotropic total variation minimization for image approximation, Two-direction subgradient method for non-differentiable optimization problems, Primal-dual subgradient methods for convex problems, Dual subgradient method with averaging for optimal resource allocation, Semi-explicit solution and fast minimization scheme for an energy with $\ell _{1}$-fitting and Tikhonov-like regularization, An optimal algorithm for global optimization and adaptive covering, Smooth minimization of non-smooth functions, Convergent Lagrangian and domain cut method for nonlinear knapsack problems, Subgradient projection algorithms for convex feasibility problems in the presence of computational errors, Single-input--single-output ${\mathcal H}_ \infty$-control with time domain constraints, Generalized gradient learning on time series, Two ``well-known properties of subgradient optimization, Subgradient algorithm on Riemannian manifolds, Conditional subgradient optimization -- theory and applications, Hamilton-Jacobi-Bellman formalism for optimal climate control of greenhouse crop, Convergence of a generalized subgradient method for nondifferentiable convex optimization, A branch and bound-outer approximation algorithm for concave minimization over a convex set, Enumeration approach for linear complementarity problems based on a reformulation-linearization technique, Main directions in the development of informatics, Subgradient methods for saddle-point problems, Convergence rates of subgradient methods for quasi-convex optimization problems, Combined entropic regularization and path-following method for solving finite convex min-max problems subject to infinitely many linear constraints, Complexity analysis of logarithmic barrier decomposition methods for semi-infinite linear programming, Inexact subgradient methods with applications in stochastic programming, An improved subgradient method for constrained nondifferentiable optimization, On the rate of convergence of two minimax algorithms, New variable-metric algorithms for nondifferentiable optimization problems, Nonmonotone bundle-type scheme for convex nonsmooth minimization, Partial linearization methods in nonlinear programming, A modified Hestenes and Stiefel conjugate gradient algorithm for large-scale nonsmooth minimizations and nonlinear equations, Primal recovery from consensus-based dual decomposition for distributed convex optimization, Global minimization by reducing the duality gap, A decomposition method for large scale MILPs, with performance guarantees and a power system application, Airline crew scheduling: state-of-the-art, Combining discrete and continuous optimization to solve kinodynamic motion planning problems, The generalized ellipsoid method, An empirical study into finding optima in stochastic optimization of neural networks, On decomposition and multiobjective-based column and disjunctive cut generation for MINLP, Using two successive subgradients in the ellipsoid method for nonlinear programming, Computational complexity of inner and outer $j$-radii of polytopes in finite-dimensional normed spaces, A primal-dual algorithm for risk minimization, A Lagrangean heuristic for the capacitated concave minimum cost network flow problem, A surrogate heuristic for set covering problems, Convergence of the proximal bundle algorithm for nonsmooth nonconvex optimization problems, Strong convergence of almost simultaneous block-iterative projection methods in Hilbert spaces, Convergence of inexact quasisubgradient methods with extrapolation, Interior quasi-subgradient method with non-Euclidean distances for constrained quasi-convex optimization problems in Hilbert spaces, On some difficult linear programs coming from set partitioning, Geometrically convergent projection method in matrix games, Separating plane algorithms for convex optimization, Optimal prestress of structures with frictional unilateral contact interfaces, On convex optimization with linear constraints, Dynamic bundle methods, Piecewise linear approximations in nonconvex nonsmooth optimization, Fast inertial dynamic algorithm with smoothing method for nonsmooth convex optimization, A generalized subgradient method with relaxation step, Cost-sensitive estimation of ARMA models for financial asset return data, An enhanced decomposition algorithm for multistage stochastic hydroelectric scheduling, Algorithms to construct a minimum-volume invariant ellipsoid for a stable dynamic system, A new algorithm for generalized fractional programs, A primal-dual approach to inexact subgradient methods, A multi-step doubly stabilized bundle method for nonsmooth convex optimization, A descent method with linear programming subproblems for nondifferentiable convex optimization, Short-term liner ship fleet planning with container transshipment and uncertain container shipment demand, The problem of projecting the origin of Euclidean space onto the convex polyhedron, A method for convex minimization based on translated first-order approximations, A parallelizable augmented Lagrangian method applied to large-scale non-convex-constrained optimization problems, An optimal subgradient algorithm with subspace search for costly convex optimization problems, Conjugate gradient based acceleration for inverse problems, An effective nonsmooth optimization algorithm for locally Lipschitz functions, Generation of acoustic solitary waves in a lattice of Helmholtz resonators, Numerical infinitesimals in a variable metric method for convex nonsmooth optimization, Linear convergence of cyclic SAGA, Conjugate gradient type methods for the nondifferentiable convex minimization, On the computational efficiency of subgradient methods: a case study with Lagrangian bounds, Steepest descent optimisation of Runge-Kutta coefficients for second order implicit finite volume CFD codes, On the convergence of conditional $\varepsilon$-subgradient methods for convex programs and convex-concave saddle-point problems., Fine tuning Nesterov's steepest descent algorithm for differentiable convex programming, Parallel multi-block ADMM with $o(1/k)$ convergence, Generalized gradients in dynamic optimization, optimal control, and machine learning problems, A numerical study of applying spectral-step subgradient method for solving nonsmooth unconstrained optimization problems, Wave propagation in a fractional viscoelastic Andrade medium: diffusive approximation and numerical modeling, Band structure optimization of two-dimensional photonic crystals in $H$-polarization, A decentralized approach to multi-agent MILPs: finite-time feasibility and performance guarantees, Construction of a generalized Voronoi diagram with optimal placement of generator points based on the theory of optimal set partitioning, A matheuristic based on Lagrangian relaxation for the multi-activity shift scheduling problem, A relaxed projection method for solving multiobjective optimization problems, Solving structured nonsmooth convex optimization with complexity $\mathcal {O}(\varepsilon ^{-1/2})$, A feasible point method with bundle modification for nonsmooth convex constrained optimization, Aggregate subgradient method for nonsmooth DC optimization, Projected subgradient minimization versus superiorization, Exact algorithms for OWA-optimization in multiobjective spanning tree problems, Finding maxmin allocations in cooperative and competitive fair division, A new infeasible proximal bundle algorithm for nonsmooth nonconvex constrained optimization, A novel convex dual approach to three-dimensional assignment problem: theoretical analysis, Incremental quasi-subgradient methods for minimizing the sum of quasi-convex functions, Inexact proximal $\epsilon$-subgradient methods for composite convex optimization problems, Solving nearly-separable quadratic optimization problems as nonsmooth equations, An inexact modified subgradient algorithm for nonconvex optimization, Convergence of stochastic proximal gradient algorithm, Weakly constrained minimization: application to the estimation of images and signals involving constant regions, A filter proximal bundle method for nonsmooth nonconvex constrained optimization, Resolving learning rates adaptively by locating stochastic non-negative associated gradient projection points using line searches, A new method based on the proximal bundle idea and gradient sampling technique for minimizing nonsmooth convex functions, A class on nonmonotone stabilization methods in unconstrained optimization, An efficient descent method for locally Lipschitz multiobjective optimization problems, Proximal algorithms in statistics and machine learning, A study on distributed optimization over large-scale networked systems, On finite convergence and constraint identification of subgradient projection methods, Convergence criteria for generalized gradient methods of solving locally Lipschitz feasibility problems, Sparse group fused Lasso for model segmentation: a hybrid approach, A dual approach to multi-dimensional assignment problems, A non-monotone conjugate subgradient type method for minimization of convex functions, Using dual network bounds in algorithms for solving generalized set packing/partitioning problems, A class of exact penalty functions and penalty algorithms for nonsmooth constrained optimization problems, A proximal-projection partial bundle method for convex constrained minimax problems, A Lagrangian-based score for assessing the quality of pairwise constraints in semi-supervised clustering, Constrained spanning trees and the traveling salesman problem, Diffusion operator and spectral analysis for directed hypergraph Laplacian, Convex optimization with an interpolation-based projection and its application to deep learning, Adapted total variation for artifact free decompression of JPEG images, Quasi-convex feasibility problems: subgradient methods and convergence rates, State-space approach to control design under partial statistical information for exogenous signals, 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., Analysis of algorithms for a class of continuous partition problems, Primal convergence from dual subgradient methods for convex optimization, A new nonsmooth trust region algorithm for locally Lipschitz unconstrained optimization problems, Self-driven algorithm for solving supermodular $(\max,+)$ labeling problems based on subgradient descent, Aggregate codifferential method for nonsmooth DC optimization, Quasi-monotone subgradient methods for nonsmooth convex minimization, Convergence analysis for the modified spectral projected subgradient method, A penalty approach to linear programs with many two-sided constraints, Machine learning algorithms of relaxation subgradient method with space extension, An indefinite proximal subgradient-based algorithm for nonsmooth composite optimization, Lagrangian bounds for large‐scale multicommodity network design: a comparison between Volume and Bundle methods, A new algorithm for the minimax location problem with the closest distance, A Sequential Quadratic Programming Algorithm for Nonsmooth Problems with Upper- ${\boldsymbol{\mathcal{C}^2}}$ Objective, New proximal bundle algorithm based on the gradient sampling method for nonsmooth nonconvex optimization with exact and inexact information, A Lagrangian heuristics for balancing the average weighted completion times of two classes of jobs in a single-machine scheduling problem, No-regret dynamics in the Fenchel game: a unified framework for algorithmic convex optimization, A column generation algorithm for solving energy system planning problems, A new nonmonotone line search method for nonsmooth nonconvex optimization, Open issues and recent advances in DC programming and DCA, A Bundle Trust Region Algorithm for Minimizing Locally Lipschitz Functions, Comparing different nonsmooth minimization methods and software, Generalized derivatives of computer programs, Subgradient method with feasible inexact projections for constrained convex optimization problems, The Newton Bracketing Method for Convex Minimization: Convergence Analysis, Anytime online novelty and change detection for mobile robots, Inexact subgradient methods for quasi-convex optimization problems, An efficient inexact Newton-CG algorithm for the smallest enclosing ball problem of large dimensions, A new trust region method for nonsmooth nonconvex 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, Gradient flows and randomised thresholding: sparse inversion and classification*, A quasi-Newton proximal bundle method using gradient sampling technique for minimizing nonsmooth convex functions, Using a sensitivity study to facilitate the design of a multi-electrode array to measure six cardiac conductivity values, Score test variable screening, Optimal congestion control algorithm for ad hoc networks: penalty function-based approach, A regularized decomposition method for minimizing a sum of polyhedral functions, Unnamed Item, Imposing Contiguity Constraints in Political Districting Models, A subgradient method for equilibrium problems involving quasiconvex bifunctions, Strong convergence of expected-projection methods in hilbert spaces, Lagrange dual bound computation for stochastic service network design, A generalization of Polyak's convergence result for subgradient optimization, The prize collecting Steiner tree problem: models and Lagrangian dual optimization approaches, An active set strategy to address the ill-conditioning of smoothing methods for solving finite linear minimax problems, Ellipsoid projection method in matrix games, A practicable way for computing the directional derivative of the optimal value function in convex programming, Lagrangian relaxations on networks by $\varepsilon $-subgradient methods, A Nonsmooth Trust-Region Method for Locally Lipschitz Functions with Application to Optimization Problems Constrained by Variational Inequalities, Two-stage time-optimal formation reconfiguration strategy, Epi-Regularization of Risk Measures, A simple nearly optimal restart scheme for speeding up first-order methods, A subgradient method with non-monotone line search, A Lagrangean Relaxation Scheme for Structured Linear Programs With Application To Multicommodity Network Flows, Extrapolated cyclic subgradient projection methods for the convex feasibility problems and their numerical behaviour, A new steepest descent differential inclusion-based method for solving general nonsmooth convex optimization problems, Unnamed Item, Online Learning Based on Online DCA and Application to Online Classification, Designing a minimal spanning tree network subject to a budget constraint, Difference convex optimization techniques in nonsmooth computational mechanics, A Deflected Subgradient Method Using a General Augmented Lagrangian Duality with Implications on Penalty Methods, String-averaging incremental stochastic subgradient algorithms, Performance of Some Approximate Subgradient Methods over Nonlinearly Constrained Networks, Design of fault-tolerant control for MTTF, Unnamed Item, Whitney differentiability of optimal-value functions for bound-constrained convex programming problems, A modified version of Tuy's method for solving d.c. programing problem, Multiple subgradient descent bundle method for convex nonsmooth multiobjective optimization, Approximate Subgradient Methods for Lagrangian Relaxations on Networks, Combining Progressive Hedging with a Frank--Wolfe Method to Compute Lagrangian Dual Bounds in Stochastic Mixed-Integer Programming, Markovian traffic equilibrium, A dual scheme for traffic assignment problems, Comparison of bundle and classical column generation, Supplier's pricing policy in a just-in-time environment, A method for minimizing convex functions based on continuous approximations to the subdifferential, Ergodic convergence in subgradient optimization, New self-concordant barrier for the hypercube, A Linearly Convergent Variant of the Conditional Gradient Algorithm under Strong Convexity, with Applications to Online and Stochastic Optimization, Bundle Method for Non-Convex Minimization with Inexact Subgradients and Function Values, Capacitated facility location problem with general setup cost, On the solution of the generalized steiner problem by the subgradient method, The omnipresence of Lagrange, Cost approximation algorithms with nonmonotone line searches for a general class of nonlinear programs, Fast linear iterations for distributed averaging, Computationally relevant generalized derivatives: theory, evaluation and applications, Branch-locking AD techniques for nonsmooth composite functions and nonsmooth implicit functions, Residual Selection in A Projection Method for Convex Minimization Problems, Semidefinite programming relaxations and algebraic optimization in control, Least-squares estimation of two-ordered monotone regression curves, The Practical Performance of Subgradient Computational Techniques for Mesh Network Utility Optimization, Mesoscopic Modeling of Stochastic Reaction-Diffusion Kinetics in the Subdiffusive Regime, Linear convergence of a modified Frank–Wolfe algorithm for computing minimum-volume enclosing ellipsoids, A merit function approach to the subgradient method with averaging, Analysis of the gradient method with an Armijo–Wolfe line search on a class of non-smooth convex functions, Essentials of numerical nonsmooth optimization, Nonconvex Robust Low-Rank Matrix Recovery, Scaling Techniques for $\epsilon$-Subgradient Methods, Diffusive Approximation of a Time-Fractional Burger's Equation in Nonlinear Acoustics, Abstract convergence theorem for quasi-convex optimization problems with applications, Convergence Rates for Deterministic and Stochastic Subgradient Methods without Lipschitz Continuity, Unnamed Item, Variational Image Regularization with Euler's Elastica Using a Discrete Gradient Scheme, Subgradient and Bundle Methods for Nonsmooth Optimization, An algorithm for minimizing a class of locally Lipschitz functions, Ghost Penalties in Nonconvex Constrained Optimization: Diminishing Stepsizes and Iteration Complexity, Algorithms for the quasiconvex feasibility problem, Weakly Convex Optimization over Stiefel Manifold Using Riemannian Subgradient-Type Methods, A primal-proximal heuristic applied to the French unit-commitment problem, Weak subgradient method for solving nonsmooth nonconvex optimization problems, An aggregate homotopy method for solving unconstrained minimax problems, An efficient lagrangean relaxation scheme for linear and integer equal flow problems, Maximum Likelihood Estimation of a Multi-Dimensional Log-Concave Density, On Modification of an Adaptive Stochastic Mirror Descent Algorithm for Convex Optimization Problems with Functional Constraints, Reduced subgradient bundle method for linearly constrained non-smooth non-convex problems, Essentials of numerical nonsmooth optimization, The behavior of Jurík's nearest point approach algorithm on some 3-dimensional problems, An Efficient Hybrid Algorithm for the Separable Convex Quadratic Knapsack Problem, Penalty/Barrier multiplier algorthm for semidefinit programming^∗, Proximal Gradient Methods for Machine Learning and Imaging