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)

• Complementarity Problems Over Symmetric Cones: A Survey of Recent Developments in Several Aspects
• 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
• 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
• Newton-type methods for inverse singular value problems with multiple singular values
• A semismooth Newton method for tensor eigenvalue complementarity problem
• Predictor-corrector smoothing Newton method, based on a new smoothing function, for solving the nonlinear complementarity problem with a \(P_0\) function
• Smoothing trust region methods for nonlinear complementarity problems with \(P_0\)-functions
• A stochastic model for risk management in global supply chain networks
• A new one-step smoothing Newton method for nonlinear complementarity problem with \(P_{0}\)-function
• Computation of nonautonomous invariant and inertial manifolds
• Quadratic convergence of a smoothing Newton method for symmetric cone programming without strict complementarity
• A partial proximal point algorithm for nuclear norm regularized matrix least squares problems
• Jacobian consistency of a one-parametric class of smoothing Fischer-Burmeister functions for SOCCP
• An effective nonsmooth optimization algorithm for locally Lipschitz functions
• Semismoothness of the maximum eigenvalue function of a symmetric tensor and its application
• A nonsmooth version of Newton's method
• The \(SC^1\) 1property of an expected residual function arising from stochastic complementarity problems
• Simultaneously optimizing link tolls and signal settings in a road network
• Convergence of the augmented Lagrangian method for nonlinear optimization problems over second-order cones
• Note on generalized convex functions
• Error bounds: necessary and sufficient conditions
• A new method for solving second-order cone eigenvalue complementarity problems
• A new method for solving Pareto eigenvalue complementarity problems
• Inexact Newton methods for solving nonsmooth equations
• Second-order directional derivatives for nonsmooth functions
• The Z -eigenvalues of a symmetric tensor and its application to spectral hypergraph theory
• Integration of multivalued operators and cyclic submonotonicity
• Second-order necessary and sufficient conditions in nonsmooth optimization
• Subsmooth sets: Functional characterizations and related concepts
• A smoothing inexact Newton method for \(P_0\) nonlinear complementarity problem
• A smoothing inexact Newton method for generalized nonlinear complementarity problem
• A UNIFIED FRAMEWORK FOR SOME INEXACT PROXIMAL POINT ALGORITHMS^*
• The convergence of a one-step smoothing Newton method for \(P_0\)-NCP based on a new smoothing NCP-function
• Discrete gradient method: Derivative-free method for nonsmooth optimization
• Constrained optimal control of Navier--Stokes flow by semismooth Newton methods
• Directional derivative of a minimax function
• Differentiability and semismoothness properties of integral functions and their applications
• A family of new smoothing functions and~a~nonmonotone smoothing Newton method for the nonlinear complementarity problems
• Nonsmooth invexity
• A strongly semismooth integral function and its application
• A one-parametric class of smoothing functions and an improved regularization Newton method for the NCP
• Submonotone Subdifferentials of Lipschitz Functions
• Semismoothness of solutions to generalized equations and the Moreau-Yosida regularization
• A Newton-type algorithm for solving problems of search theory
• Feasible direction method for bilevel programming problem
• A smoothing Newton's method for the construction of a damped vibrating system from noisy test eigendata
• A new one-step smoothing newton method for the second-order cone complementarity problem
• A non-interior continuation method for second-order cone programming
• A smoothing-type algorithm for the second-order cone complementarity problem with a new nonmonotone line search
• Calmness of constraint systems with applications
• A non-monotone inexact regularized smoothing Newton method for solving nonlinear complementarity problems
• Solvability of monotone tensor complementarity problems
• Convergence rate of Newton's method for \(L_2\) spectral estimation
• Smoothing methods for nonsmooth, nonconvex minimization
• Analysis of nonsmooth vector-valued functions associated with infinite-dimensional second-order cones
• Piecewise Ck functions in nonsmooth analysis
• Calmness of set-valued mappings between Asplund spaces and application to equilibrium problems
• A TFETI domain decomposition solver for elastoplastic 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)