Semismooth and Semiconvex Functions in Constrained Optimization

DOI10.1137/0315061zbMATH Open0376.90081OpenAlexW2067547116MaRDI QIDQ4156597FDOQ4156597

Robert Mifflin

Publication date: 1977

Published in: SIAM Journal on Control and Optimization (Search for Journal in Brave)

Full work available at URL: http://pure.iiasa.ac.at/id/eprint/524/1/RR-76-021.pdf

Recommendations

• scientific article; zbMATH DE number 3975736
• Nondifferentiable optimization by smooth approximations
• An algorithm to minimize the sum of a semi-smooth function and a \(C^ 1\) function
• An introduction to the theory of nonsmooth optimization
• Second-Order Necessary Conditions in Constrained Semismooth Optimization

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Nonsmooth analysis (49J52)

Cited In (only showing first 100 items - show all)

• Stochastic generalized-differentiable functions in the problem of nonconvex nonsmooth stochastic optimization
• On the convergence properties of a second-order augmented Lagrangian method for nonlinear programming problems with inequality constraints
• Tensor complementarity problems. II: Solution methods
• A semismooth Newton method for implicitly constituted non-Newtonian fluids and its application to the numerical approximation of Bingham flow
• An iterative method for solving semismooth equations
• On a new class parametrized Newton-like method for semismooth equations
• Constructing a sequence of discrete Hessian matrices of an \(SC^{1}\) function uniformly convergent to the generalized Hessian matrix
• No-arbitrage interpolation of the option price function and its reformulation
• Locally unique solutions of nonsmooth general variational inequalities
• Unified convergence analysis of a second-order method of multipliers for nonlinear conic programming
• Computer-aided design via optimization: A review
• Inexact-Newton method for solving operator equations in infinite-dimensional spaces
• A smoothing-type Newton method for second-order cone programming problems based on a new smooth function
• An inexact SQP Newton method for convex SC\(^{1}\) minimization problems
• Tensor absolute value equations
• Global convergence of ADMM in nonconvex nonsmooth optimization
• A globally and superlinearly convergent trust region method for \(LC^1\) optimization problems
• A generalized inexact Newton method for inverse eigenvalue problems
• Title not available (Why is that?)
• On minimizing the implicit Lagrangian for nonlinear complementarity problems under \(H\)-differentiability
• Optimization for signal setting problems using non-smooth techniques
• On minimizing some merit functions for nonlinear complementarity problems under \(H\) -differentiability
• Approximating Clarke's subgradients of semismooth functions by divided differences
• A semismooth Newton method for nonlinear symmetric cone programming
• A note on convergence analysis of an SQP-type method for nonlinear semidefinite programming
• The semismooth approach for semi-infinite programming under the reduction ansatz
• A globally convergent iterative scheme for toll design network with signal settings
• A nonmonotone smoothing Newton method for circular cone programming
• An efficient search algorithm for road network optimization
• Numerical methods for nonlinear equations
• Title not available (Why is that?)
• A smoothing Newton-type method for solving the \(L _{2}\) spectral estimation problem with lower and upper bounds
• The Rate of Convergence of a NLM Based on F–B NCP for Constrained Optimization Problems Without Strict Complementarity
• Minmaxmin problems revisited
• Some properties of nondifferentiable pseudoconvex functions
• Newton method for finding a singularity of a special class of locally Lipschitz continuous vector fields on Riemannian manifolds
• A smoothing Newton method for mathematical programs governed by second-order cone constrained generalized equations
• Total variation regularization of multi-material topology optimization
• Newton-type methods: a broader view
• Optimality conditions of approximate solutions for nonsmooth semi-infinite programming problems
• Variational analysis of paraconvex multifunctions
• Convexification of nonsmooth monotone functions
• Piecewise partially separable functions and a derivative-free algorithm for large scale nonsmooth optimization
• Limited memory discrete gradient bundle method for nonsmooth derivative-free optimization
• An implementable algorithm for the optimal design centering, tolerancing, and tuning problem
• A cutting plane projection method for bi-level area traffic control optimization with uncertain travel demand
• An introduction to the theory of nonsmooth optimization
• Smoothing Newton method for operator equations in Banach spaces
• A nonsmooth version of the univariate optimization algorithm for locating the nearest extremum (locating extremum in nonsmooth univariate optimization)
• Sub-quadratic convergence of a smoothing Newton method for second-order cone programming
• A Superlinearly Convergent Smoothing Newton Continuation Algorithm for Variational Inequalities over Definable Sets
• Second-order necessary conditions in semismooth optimization
• A vector forward mode of automatic differentiation for generalized derivative evaluation
• A Sard theorem for tame set-valued mappings
• A generalized Jacobian based Newton method for semismooth block-triangular system of equations
• Inverse and implicit function theorems forH-differentiable and semismooth functions
• \(\varepsilon \)-optimality and \(\varepsilon \)-Lagrangian duality for a nonconvex programming problem with an infinite number of constraints
• Characterizations of optimal solution sets of convex infinite programs
• Title not available (Why is that?)
• Properties of a family of generalized NCP-functions and a derivative free algorithm for complementarity problems
• A partially smoothing Jacobian method for nonlinear complementarity problems with \(P_0\) function
• On constraint qualifications in terms of approximate Jacobians for nonsmooth continuous optimization problems
• Newton methods for solving two classes of nonsmooth equations.
• Improved smoothing Newton methods for \(P_0\) nonlinear complementarity problems
• An alternating iterative method and its application in statistical inference
• An algorithm based on resolvent operators for solving variational inequalities in Hilbert spaces
• Results of farkas type
• An approximate subgradient algorithm for unconstrained nonsmooth, nonconvex optimization
• On the regularity of second order cone programs and an application to solving large scale problems
• A smoothing Newton algorithm for solving the monotone second-order cone complementarity problems
• A nonmonotone Levenberg-Marquardt method for nonlinear complementarity problems under local error bound
• Superlinear/quadratic one-step smoothing Newton method for \(P_0\)-NCP
• Spectral operators of matrices
• On the superlinear convergence in computational elasto-plasticity
• Calibration of estimator-weights via semismooth Newton method
• On the local uniqueness of solutions of variational inequalities under \(H\)-differentiability
• On parametric nonlinear programming
• Semismooth Newton method for the lifted reformulation of mathematical programs with complementarity constraints
• The numerical study of a regularized smoothing Newton method for solving \(P_{0}\)-NCP based on the generalized smoothing Fischer-Burmeister function
• An adaptive finite-element Moreau–Yosida-based solver for a non-smooth Cahn–Hilliard problem
• Solving box constrained variational inequalities by using the natural residual with D-gap function globalization
• Tangencially continuous directional derivatives in nonsmooth analysis
• Local feasible QP-free algorithms for the constrained minimization of SC\(^1\) functions
• On sensitivity analysis of nonsmooth multidisciplinary optimization problems in engineering process line applications
• A regularization smoothing Newton method for solving nonlinear complementarity problem
• The Minimization of Semicontinuous Functions: Mollifier Subgradients
• Algebraic univalence theorems for nonsmooth functions
• The augmented Lagrangian method for a type of inverse quadratic programming problems over second-order cones
• An optimization model for area traffic control with link tolls
• A Newton's method for perturbed second-order cone programs
• A non-monotone regularization Newton method for the second-order cone complementarity problem
• Complete characterizations of local weak sharp minima with applications to semi-infinite optimization and complementarity
• A smoothing Newton method for a type of inverse semi-definite quadratic programming problem
• Smoothing functions and smoothing Newton method for complementarity and variational inequality problems
• A globally convergent Newton method for convex \(SC^ 1\) minimization problems
• Tangency and differentiation: Some applications of convergence theory
• Generalized derivatives and nonsmooth optimization, a finite dimensional tour (with comments and rejoinder)
• Newton's method and its use in optimization
• Optimization of robust area traffic control with equilibrium flow under demand uncertainty
• Max–min separability

This page was built for publication: Semismooth and Semiconvex Functions in Constrained Optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4156597)