Semismooth and Semiconvex Functions in Constrained Optimization

DOI10.1137/0315061zbMATH Open0376.90081OpenAlexW2067547116MaRDI QIDQ4156597FDOQ4156597

Authors: 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 superlinearly convergent smoothing Newton continuation algorithm for variational inequalities over definable sets
• 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
• 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
• 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
• The rate of convergence of a NLM based on F-B NCP for constrained optimization problems without strict complementarity
• A generalized Jacobian based Newton method for semismooth block-triangular system of equations
• Nonsmooth bundle trust-region algorithm with applications to robust stability
• Composite proximal bundle method
• A family of second-order methods for convex \(\ell _1\)-regularized optimization
• Direct search algorithm for bilevel programming problems
• Descent methods for composite nondifferentiable optimization problems
• A new non-interior continuation method for solving the second-order cone complementarity problem
• A regularization smoothing method for second-order cone complementarity problem
• ON SOME NCP-FUNCTIONS BASED ON THE GENERALIZED FISCHER–BURMEISTER FUNCTION
• A smoothing Newton method for the second-order cone complementarity problem.
• Approximately convex functions and approximately monotonic operators
• On second derivatives for nonsmooth functions
• A method for minimizing the sum of a convex function and a continuously differentiable function
• An optimal scheme for toll pricing problem
• An inexact smoothing method for SOCCPs based on a one-parametric class of smoothing function
• A smoothing Newton algorithm for weighted linear complementarity problem
• A minimization method for the sum of a convex function and a continuously differentiable function
• A smoothing Newton method for second-order cone optimization based on a new smoothing function
• A proximal point algorithm for the monotone second-order cone complementarity problem
• A new smoothing Newton-type method for second-order cone programming problems
• A damped Gauss-Newton method for the second-order cone complementarity problem
• A smoothing Newton method based on a one-parametric class of smoothing function for SOCCP
• The semismooth-related properties of a merit function and a descent method for the nonlinear complementarity problem
• A smoothing Newton method with Fischer-Burmeister function for second-order cone complementarity problems
• A one-step smoothing Newton method for second-order cone programming
• Variable metric bundle methods: From conceptual to implementable forms
• A new smoothing and regularization Newton method for \(P_{0}\)-NCP
• Asymptotic dual conditions characterizing optimality for infinite convex programs
• New fractional error bounds for polynomial systems with applications to Hölderian stability in optimization and spectral theory of tensors
• The \(Z\)-eigenvalues of a symmetric tensor and its application to spectral hypergraph theory.
• Computing proximal points of nonconvex functions
• A smoothing method for second order cone complementarity problem
• Smoothing Newton algorithm for the second-order cone programming with a nonmonotone line search
• An augmented Lagrangian method for a class of Inverse quadratic programming problems
• Solution of monotone complementarity problems with locally Lipschitzian functions
• Essentially smooth Lipschitz functions
• Nondifferential optimization via adaptive smoothing
• A proximal bundle method for nonsmooth nonconvex functions with inexact information
• Unsupervised and supervised data classification via nonsmooth and global optimization (with comments and rejoinder)
• Subdifferentials of compactly Lipschitzian vector-valued functions
• A new smoothing Newton-type algorithm for semi-infinite programming
• A smoothing inexact Newton method for nonlinear complementarity problems
• Inexact-Newton methods for semismooth systems of equations with block-angular structure
• A smoothing projected Newton-type algorithm for semi-infinite programming
• A nonsmooth inexact Newton method for the solution of large-scale nonlinear complementarity problems
• A modified feasible semi-smooth asymptotically Newton method for nonlinear complementarity problems

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)