[LIBRO][B] Numerical optimization: theoretical and practical aspects
JF Bonnans, JC Gilbert, C Lemaréchal… - 2006 - books.google.com
Just as in its 1st edition, this book starts with illustrations of the ubiquitous character of
optimization, and describes numerical algorithms in a tutorial way. It covers fundamental …
optimization, and describes numerical algorithms in a tutorial way. It covers fundamental …
Inequality constrained stochastic nonlinear optimization via active-set sequential quadratic programming
We study nonlinear optimization problems with a stochastic objective and deterministic
equality and inequality constraints, which emerge in numerous applications including …
equality and inequality constraints, which emerge in numerous applications including …
Iteration-complexity of first-order augmented Lagrangian methods for convex programming
This paper considers a special class of convex programming (CP) problems whose feasible
regions consist of a simple compact convex set intersected with an affine manifold. We …
regions consist of a simple compact convex set intersected with an affine manifold. We …
[LIBRO][B] Lagrange-type functions in constrained non-convex optimization
AM Rubinov, X Yang - 2003 - books.google.com
Lagrange and penalty function methods provide a powerful approach, both as a theoretical
tool and a computational vehicle, for the study of constrained optimization problems …
tool and a computational vehicle, for the study of constrained optimization problems …
A linesearch-based derivative-free approach for nonsmooth constrained optimization
In this paper, we propose new linesearch-based methods for nonsmooth constrained
optimization problems when first-order information on the problem functions is not available …
optimization problems when first-order information on the problem functions is not available …
An exact penalty approach for optimization with nonnegative orthogonality constraints
Optimization with nonnegative orthogonality constraints has wide applications in machine
learning and data sciences. It is NP-hard due to some combinatorial properties of the …
learning and data sciences. It is NP-hard due to some combinatorial properties of the …
A two-step iteration mechanism for speckle reduction in optical coherence tomography
Optical coherence tomography (OCT) is an imaging tool that has been widely utilized for
various disease diagnoses for its noninvasive and high-resolution properties. Due to the …
various disease diagnoses for its noninvasive and high-resolution properties. Due to the …
Dislocation hyperbolic augmented Lagrangian algorithm for nonconvex optimization
The dislocation hyperbolic augmented Lagrangian algorithm (DHALA) solves the
nonconvex programming problem considering an update rule for its penalty parameter and …
nonconvex programming problem considering an update rule for its penalty parameter and …
Tension vector and structure matrix associated force sensitivity of a 6-DOF cable-driven parallel robot
Q Chen, Q Lin, G Wei, L Ren - Proceedings of the Institution …, 2022 - journals.sagepub.com
This paper investigates the force sensitivity of 6-DOF cable-driven parallel robots (CDPRs)
in order to propose a better force measurement device. Kinematics and dynamics for a …
in order to propose a better force measurement device. Kinematics and dynamics for a …
A new class of exact penalty functions and penalty algorithms
C Wang, C Ma, J Zhou - Journal of Global Optimization, 2014 - Springer
For nonlinear programming problems, we propose a new class of smooth exact penalty
functions, which includes both barrier-type and exterior-type penalty functions as special …
functions, which includes both barrier-type and exterior-type penalty functions as special …