A new inexact line search method for convex optimization problems

QR Code

A new inexact line search method for convex optimization problems

In general one can say that line search procedure for the steplength and search direction are two important elements of a line search algorithm. The line search procedure requires much attention because of its far implications on the robustness and efficiency of the algorithm. The purpose of this pa...

Full description

Bibliographic Details
Main Authors:	Moyi, Aliyu Usman, Leong, Wah June
Format:	Conference or Workshop Item
Language:	English
Published:	2013
Online Access:	http://psasir.upm.edu.my/id/eprint/27578/ http://psasir.upm.edu.my/id/eprint/27578/1/ID%2027578.pdf

Similar Items

A three-term conjugate gradient method with nonmonotone line search for unconstrained optimization
by: Moyi, Aliyu Usman, et al.
Published: (2016)

Comparison of the AIM conjugate gradient method under exact and inexact line search for solving unconstrained optimization problems
by: Za’aba, Fatin Nadhirah, et al.
Published: (2021)

An Inexact Dual Fast Gradient-Projection Method for Separable Convex Optimization with Linear Coupled Constraints
by: Li, J., et al.
Published: (2015)

Sufficient descent three term conjugate gradient method via symmetric rank-one update for large-scale optimization
by: Moyi, Aliyu Usman, et al.
Published: (2016)

Convergence and stability of line search methods for unconstrained optimization.
by: Leong, Wah June, et al.
Published: (2013)

A multiperson pursuit problem on a closed convex set in Hilbert space
by: Leong, Wah June, et al.
Published: (2008)

A class of diagonal quasi-newton methods for large-scale convex minimization
by: Leong, Wah June
Published: (2015)

Symmetric rank-one method and its modifications for unconstrained optimization
by: Moyi, Aliyu Usman
Published: (2014)

Convergence and Stability of Line Search Methods for Unconstrained Optimization
by: Leong, Wah, et al.
Published: (2013)

Convergence of the Steepest Descent Method for Minimizing Convex Functions
by: Abu Hassan, Malik, et al.
Published: (2002)

A new modified conjugate gradient method under the strong Wolfe line search for solving unconstrained optimization problems
by: Ishak, M. I., et al.
Published: (2022)

BFGS method: a new search direction
by: Mohd. Asrul Hery Ibrahim,, et al.
Published: (2014)

BFGS method: a new search direction
by: Ibrahim, Mohd Asrul Hery, et al.
Published: (2014)

New BFGS method for unconstrained optimization problem based on modified Armijo line search
by: Wan, Zhong, et al.
Published: (2012)

Two-step derivative-free diagonally Newton's method for large-scale nonlinear equations
by: Yusuf, Mohammed Waziri, et al.
Published: (2013)

Using Pattern Search Methods for Minimizing Clustering Problems
by: Shabanzadeh, Parvaneh, et al.
Published: (2010)

A nonsmooth optimization method for clustering problem
by: Shabanzadeh, Parvaneh, et al.
Published: (2009)

Optimality Conditions for Semivectorial Bilevel Convex Optimal Control Problems
by: Bonnel, Henri, et al.
Published: (2013)

A derivative-free optimization method for solving classification problem
by: Shabanzadeh, Parvaneh, et al.
Published: (2010)

Robust time-delay estimation for nonlinear systems using inexact output
by: Gong, Z., et al.
Published: (2018)

State-delay estimation for nonlinear systems using inexact output data
by: Lin, Qun, et al.
Published: (2014)

Semivectorial bilevel convex optimal control problems: Existence results
by: Bonnel, Henri, et al.
Published: (2012)

The hybrid BFGS-CG method in solving unconstrained optimization problems
by: Ibrahim, Mohd Asrul Hery, et al.
Published: (2014)

Optimization Over the Efficient Set of Multi-objective Convex Optimal Control Problems
by: Bonnel, Henri, et al.
Published: (2010)

A new diagonal gradient-type method for large scale unconstrained optimization
by: Farid, Mahboubeh, et al.
Published: (2013)

The CG-BFGS method for unconstrained optimization problems
by: Ibrahim, Mohd Asrul Hery, et al.
Published: (2013)

A new stepsize for gradient method via weak secant equation
by: Leong, Wah June
Published: (2007)

Modified Quasi-Newton Methods For Large-Scale Unconstrained Optimization
by: Leong, Wah June
Published: (2003)

An Application of Differential Search Algorithm in Solving Non-Convex Economic Dispatch Problems with Valve-Point Effects
by: M. H., Sulaiman
Published: (2013)

A new two-step gradient-type method for large-scale unconstrained optimization
by: Farid, Mahboubeh, et al.
Published: (2010)

An alternating direction method for solving convex nonlinear semidefinite programming problems
by: Zhang, S., et al.
Published: (2013)

Distributed proximal-gradient methods for convex optimization with inequality constraints
by: Li, J., et al.
Published: (2014)

A fast dual gradient method for separable convex optimization via smoothing
by: Li, J., et al.
Published: (2016)

Triangulability of convex graphs and convex skewness
by: Ali, Niran Abbas, et al.
Published: (2021)

Efficient ODE-based methods for unconstrained optimization
by: Yap, Chui Ying, et al.
Published: (2018)

A new full Nesterov-Todd step feasible interior-point method for convex quadratic symmetric cone optimization
by: Wang, G., et al.
Published: (2013)

Fractional differential calculus on riemannian manifolds and convexity problems
by: Wedad Saleh, Al-Lehabi
Published: (2017)

An improved multi-step gradient-type method for large scale optimization
by: Farid, Mahboubeh, et al.
Published: (2011)

A new gradient method via least change secant update
by: Leong, Wah June, et al.
Published: (2011)

Cellular Harmony Search for Optimization Problems
by: Al-Betar, Mohammed Azmi, et al.
Published: (2013)