scientific article
From MaRDI portal
Publication:4004158
zbMath0757.49017MaRDI QIDQ4004158
Marko M. Mäkelä, Pekka Neittaanmäki
Publication date: 18 September 1992
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
nonsmooth analysissensitivity analysisoptimality conditionssubdifferentialsproximal bundle methoddistributed parameter controlnonsmooth optimal controloptimal shape designs
Numerical mathematical programming methods (65K05) Convex programming (90C25) Nonlinear programming (90C30) Nonsmooth analysis (49J52) Existence theories for optimal control problems involving partial differential equations (49J20) Research exposition (monographs, survey articles) pertaining to calculus of variations and optimal control (49-02)
Related Items (only showing first 100 items - show all)
Homotopy method for a class of multiobjective optimization problems with equilibrium constraints ⋮ Comparing different nonsmooth minimization methods and software ⋮ The global optimal solution to the three-dimensional layout optimization model with behavioral constraints. ⋮ Optimality conditions for a nonlinear boundary value problem using nonsmooth analysis ⋮ Combination of steepest descent and BFGS methods for nonconvex nonsmooth optimization ⋮ A gradient sampling method based on ideal direction for solving nonsmooth optimization problems ⋮ A primal-dual algorithm for risk minimization ⋮ Bundle-based descent method for nonsmooth multiobjective DC optimization with inequality constraints ⋮ Convergence of the proximal bundle algorithm for nonsmooth nonconvex optimization problems ⋮ \textit{Physarum} can compute shortest paths ⋮ A new trust region method for nonsmooth nonconvex optimization ⋮ Survey of Bundle Methods for Nonsmooth Optimization ⋮ On cone characterizations of strong and Lexicographic optimality in convex multiobjective optimization ⋮ Nonconvex bundle method with application to a delamination problem ⋮ An inexact multiple proximal bundle algorithm for nonsmooth nonconvex multiobjective optimization problems ⋮ An ODE-like nonmonotone method for nonsmooth convex optimization ⋮ On numerical solution of hemivariational inequalities by nonsmooth optimization methods ⋮ A trust region method for solving linearly constrained locally Lipschitz optimization problems ⋮ A bundle-free implicit programming approach for a class of elliptic MPECs in function space ⋮ A variable metric method for nonsmooth convex constrained optimization ⋮ Subgradient method for nonconvex nonsmooth optimization ⋮ A proximal bundle method for nonsmooth DC optimization utilizing nonconvex cutting planes ⋮ Globally convergent limited memory bundle method for large-scale nonsmooth optimization ⋮ A bundle modification strategy for convex minimization ⋮ Interval methods for global optimization ⋮ A hybrid approach of bundle and Benders applied large mixed linear integer problem ⋮ Generalization of hyperbolic smoothing approach for non-smooth and non-Lipschitz functions ⋮ On solving generalized convex MINLP problems using supporting hyperplane techniques ⋮ An extension of the quasi-Newton method for minimizing locally Lipschitz functions ⋮ Clustering and the perturbed spatial median ⋮ A method for convex minimization based on translated first-order approximations ⋮ A simple version of bundle method with linear programming ⋮ Clusterwise support vector linear regression ⋮ Limited memory interior point bundle method for large inequality constrained nonsmooth minimization ⋮ New diagonal bundle method for clustering problems in large data sets ⋮ Conjugate gradient type methods for the nondifferentiable convex minimization ⋮ A system of nonsmooth equations solver based upon subgradient method ⋮ A Riemannian Gradient Sampling Algorithm for Nonsmooth Optimization on Manifolds ⋮ A partially inexact bundle method for convex semi-infinite minmax problems ⋮ Experiments with classification-based scalarizing functions in interactive multiobjective optimization ⋮ A class of infeasible proximal bundle methods for nonsmooth nonconvex multi-objective optimization problems ⋮ Interactive solution approach to a multiobjective optimization problem in a paper machine headbox design ⋮ Spectral projected subgradient method for nonsmooth convex optimization problems ⋮ An alternating linearization method with inexact data for bilevel nonsmooth convex optimization ⋮ A new steepest descent differential inclusion-based method for solving general nonsmooth convex optimization problems ⋮ An infeasible bundle method for nonconvex constrained optimization with application to semi-infinite programming problems ⋮ Diagonal bundle method with convex and concave updates for large-scale nonconvex and nonsmooth optimization ⋮ A successive quadratic programming algorithm for SDP relaxation of Max-Bisection ⋮ A sharp augmented Lagrangian-based method in constrained non-convex optimization ⋮ Interior epigraph directions method for nonsmooth and nonconvex optimization via generalized augmented Lagrangian duality ⋮ An SQP method for minimization of locally Lipschitz functions with nonlinear constraints ⋮ Constrained nonconvex nonsmooth optimization via proximal bundle method ⋮ An augmented subgradient method for minimizing nonsmooth DC functions ⋮ Zero density lower bounds in topology optimization ⋮ Diagonal bundle method for nonsmooth sparse optimization ⋮ Multiple subgradient descent bundle method for convex nonsmooth multiobjective optimization ⋮ Reverse propagation of McCormick relaxations ⋮ Solving some optimal control problems using the barrier penalty function method ⋮ A redistributed bundle algorithm based on local convexification models for nonlinear nonsmooth DC programming ⋮ A noninterior point homotopy method for semi-infinite programming problems ⋮ A modified nonlinear conjugate gradient algorithm for large-scale nonsmooth convex optimization ⋮ Proximal point method for a special class of nonconvex multiobjective optimization functions ⋮ Duality for multi objective fractional programming via linearization and scalarization approaches. ⋮ Aggregate subgradient method for nonsmooth DC optimization ⋮ A quasisecant method for solving a system of nonsmooth equations ⋮ An adaptive competitive penalty method for nonsmooth constrained optimization ⋮ Globally convergent cutting plane method for nonconvex nonsmooth minimization ⋮ Sufficient optimality and sensitivity analysis of a parameterized min-max programming ⋮ A new infeasible proximal bundle algorithm for nonsmooth nonconvex constrained optimization ⋮ Denoising of smooth images using \(L^{1}\)-fitting ⋮ Reachable set bounding for delayed systems with polytopic uncertainties: the maximal Lyapunov-Krasovskii functional approach ⋮ A filter proximal bundle method for nonsmooth nonconvex constrained optimization ⋮ Adaptive limited memory bundle method for bound constrained large-scale nonsmooth optimization ⋮ A new method based on the proximal bundle idea and gradient sampling technique for minimizing nonsmooth convex functions ⋮ Algorithmic differentiation for piecewise smooth functions: a case study for robust optimization ⋮ A Redistributed Bundle Algorithm for Generalized Variational Inequality Problems in Hilbert Spaces ⋮ An efficient descent method for locally Lipschitz multiobjective optimization problems ⋮ An effective adaptive trust region algorithm for nonsmooth minimization ⋮ Double Bundle Method for finding Clarke Stationary Points in Nonsmooth DC Programming ⋮ Semisupervised spherical separation ⋮ A filter-variable-metric method for nonsmooth convex constrained optimization ⋮ On interactive multiobjective optimization with NIMBUS® in chemical process design ⋮ A modified quasisecant method for global optimization ⋮ Characterization of generalized FJ and KKT conditions in nonsmooth nonconvex optimization ⋮ A non-monotone conjugate subgradient type method for minimization of convex functions ⋮ Nonsmooth and nonconvex optimization via approximate difference-of-convex decompositions ⋮ An algorithm for nonsmooth optimization by successive piecewise linearization ⋮ Interactive multiobjective optimization system WWW-NIMBUS on the Internet ⋮ Subgradient and Bundle Methods for Nonsmooth Optimization ⋮ Three-dimensional adhesive contact laws with debonding: A nonconvex energy bundle method ⋮ A bundle-Newton method for nonsmooth unconstrained minimization ⋮ Numerical methods for nonlinear inverse problems ⋮ Continuous outer subdifferentials in nonsmooth optimization ⋮ Higher-moment buffered probability ⋮ On the computation of an element of Clarke generalized Jacobian for a vector-valued max function ⋮ Efficient hybrid methods for global continuous optimization based on simulated annealing ⋮ Synchronous approach in interactive multiobjective optimization ⋮ Aggregate codifferential method for nonsmooth DC optimization ⋮ Limited memory discrete gradient bundle method for nonsmooth derivative-free optimization ⋮ A modified Hestenes and Stiefel conjugate gradient algorithm for large-scale nonsmooth minimizations and nonlinear equations
This page was built for publication:
